Timeline for Complexity Measures for Mathematical Programming
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 4, 2017 at 5:09 | vote | accept | Manfred Weis | ||
| Oct 2, 2017 at 13:06 | comment | added | rasul | @AmirSagiv Almost every textbook on integer programming is a good reference. I edited the question and added a reference for a formal definition. | |
| Oct 2, 2017 at 13:02 | history | edited | rasul | CC BY-SA 3.0 | added 1196 characters in body |
| Oct 2, 2017 at 12:44 | comment | added | Manfred Weis | There is the The Bad and the Good-and-Ugly: Formulations for the Traveling Salesman Problem article by Pataki, which explains the issue quite well. I am aware, that my measure may give a wrong impression in some cases, especially in the case of "lazy" generation of constraints, but it should give some indication for the case of a priori generation of all constraints. | |
| Oct 2, 2017 at 12:25 | comment | added | Amir Sagiv | Hi Opt, welcome to MO. As it is- the answer is a bit hard to work with. You use a lot of terminology that I'm not sure whether the general audience here, let alone the OP, knows. Why not use some references or Wiki links? | |
| Oct 2, 2017 at 12:14 | review | First posts | |||
| Oct 2, 2017 at 12:25 | |||||
| Oct 2, 2017 at 12:11 | history | answered | rasul | CC BY-SA 3.0 |