Timeline for Solving NP problems in (usually) Polynomial time?
Current License: CC BY-SA 2.5
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 3, 2012 at 4:49 | comment | added | Dima Pasechnik | I don't know what makes you think that the simplex method is usually the fastest. Modern interior-point solvers beat the simplex method quite handily. What is right, though, is that some variations of the simplex method are very easy to restart after adding an extra constraint, while interior-point methods cannot be restarted easily. | |
| Jan 1, 2010 at 19:09 | history | edited | Harrison Brown | CC BY-SA 2.5 |
added 654 characters in body
|
| Jan 1, 2010 at 9:08 | history | answered | Harrison Brown | CC BY-SA 2.5 |