The Simplex Algorithm Is NP-Mighty

@article{Disser2019TheSA,
  title={The Simplex Algorithm Is NP-Mighty},
  author={Y. Disser and M. Skutella},
  journal={ACM Transactions on Algorithms (TALG)},
  year={2019},
  volume={15},
  pages={1 - 19}
}
  • Y. Disser, M. Skutella
  • Published 2019
  • Mathematics, Computer Science
  • ACM Transactions on Algorithms (TALG)
We show that the Simplex Method, the Network Simplex Method—both with Dantzig’s original pivot rule—and the Successive Shortest Path Algorithm are NP-mighty. That is, each of these algorithms can be used to solve, with polynomial overhead, any problem in NP implicitly during the algorithm’s execution. This result casts a more favorable light on these algorithms’ exponential worst-case running times. Furthermore, as a consequence of our approach, we obtain several novel hardness results. For… Expand
1 Citations
Macroscopic evacuation plans for natural disasters

References

SHOWING 1-6 OF 6 REFERENCES
The Complexity of the Simplex Method
On the complexity of local search
The Complexity of All-switches Strategy Improvement
The Complexity of the Homotopy Method, Equilibrium Selection, and Lemke-Howson Solutions
Flows in Networks
Activity Analysis of Production and Allocation.