An exponential lower bound for Cunningham’s rule-Reference-Cited by-同舟云学术

An exponential lower bound for Cunningham’s rule

Published:2016-04-11 Issue:1-2 Volume:161 Page:271-305
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Math. Program.

Author:

Avis David,Friedmann Oliver

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/s10107-016-1008-4.pdf

Reference25 articles.

1. Aoshima, Y., Avis, D., Deering, T., Matsumoto, Y., Moriyama, S.: On the existence of hamiltonian paths for history based pivot rules on acyclic unique sink orientations of hypercubes. Discrete Appl. Math. 160(15), 2104–2115 (2012)

2. Avis, D., Moriyama, S.: On combinatorial properties of linear programming digraphs. In: Avis, D., Bremner, D., Deza, A. (eds.) Polyhedral Computation, CRM Proceedings and Lecture Notes 48, pp. 1–13. AMS, Providence (2009)

3. Bertsekas, D.: Dynamic Programming and Optimal Control, 2nd edn. Athena Scientific, Belmont (2001)

4. Chvátal, V.: Linear Programmming. W.H. Freeman, New York (1983)

5. Cunningham, W.H.: Theoretical properties of the network simplex method. Math. Oper. Res. 4(2), 196–208 (1979)

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the Simplex Method for 0/1-Polytopes;Mathematics of Operations Research;2024-06-05

2. On the Number of Degenerate Simplex Pivots;Lecture Notes in Computer Science;2024

3. Inapproximability of shortest paths on perfect matching polytopes;Mathematical Programming;2023-10-21

4. The Polyhedral Geometry of Pivot Rules and Monotone Paths;SIAM Journal on Applied Algebra and Geometry;2023-08-14

5. The Smoothed Complexity of Policy Iteration for Markov Decision Processes;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02