Timeline for Convex integer programming on totally unimodular polytope?
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 4, 2018 at 14:50 | vote | accept | Turbo | ||
| May 4, 2018 at 12:36 | comment | added | Turbo | However it seems that if the compact polytope is far away from the origin (the binary cube is close to origin) in a generic position the first point an ellipsoid with center close to origin would hit as it grows in volume would be a vertex point. Also I have a convex objective here. | |
| May 4, 2018 at 12:33 | vote | accept | Turbo | ||
| May 4, 2018 at 12:33 | |||||
| May 4, 2018 at 11:56 | history | answered | Michal Adamaszek | CC BY-SA 4.0 |