Timeline for How fast can we solve a totally unimodular integer linear program?
Current License: CC BY-SA 2.5
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 17, 2020 at 9:38 | history | edited | CommunityBot |
Commonmark migration
|
|
| Aug 19, 2017 at 22:58 | comment | added | Neal Young | As pointed out by the answer you cite to your previous post, your problem is a special case of the transportation problem, which is in turn a special case of minimum-cost flow. See here and here for posts asking for fast algorithms for these two problems. | |
| Apr 13, 2017 at 12:32 | history | edited | CommunityBot |
replaced http://cstheory.stackexchange.com/ with https://cstheory.stackexchange.com/
|
|
| Mar 8, 2017 at 6:55 | answer | added | user3483902 | timeline score: 1 | |
| Jan 24, 2011 at 12:50 | answer | added | Falk Hüffner | timeline score: 3 | |
| Jan 23, 2011 at 2:28 | vote | accept | gphilip | ||
| Jan 21, 2011 at 23:05 | answer | added | Abel Molina | timeline score: 13 | |
| Jan 21, 2011 at 13:55 | history | tweeted | twitter.com/#!/StackCSTheory/status/28450665470627841 | ||
| Jan 21, 2011 at 12:21 | history | asked | gphilip | CC BY-SA 2.5 |