Computing monotone disjoint paths on polytopes
Author
Abstract
Suggested Citation
DOI: 10.1007/s10878-008-9151-3
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Michael J. Todd, 1980. "The Monotonic Bounded Hirsch Conjecture is False for Dimension at Least 4," Mathematics of Operations Research, INFORMS, vol. 5(4), pages 599-601, November.
- Fukuda, K. & Terlaky, T., 1999. "On the existence of a short admissible pivot sequence for feasibility and linear optimization problems," Pure Mathematics and Applications, Department of Mathematics, Corvinus University of Budapest, vol. 10(4), pages 431-447.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Yasuko Matsui & Noriyoshi Sukegawa & Ping Zhan, 2023. "Monotone Diameter of Bisubmodular Polyhedra," SN Operations Research Forum, Springer, vol. 4(4), pages 1-16, December.
- Konstantinos Paparrizos & Nikolaos Samaras & Angelo Sifaleras, 2015. "Exterior point simplex-type algorithms for linear and network optimization problems," Annals of Operations Research, Springer, vol. 229(1), pages 607-633, June.
- Francisco Santos, 2013. "Recent progress on the combinatorial diameter of polytopes and simplicial complexes," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 21(3), pages 426-460, October.
- Biressaw C. Wolde & Torbjörn Larsson, 2024. "A steepest feasible direction method for linear programming. Derivation and embedding in the simplex method," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 34(2), pages 163-182.
More about this item
Keywords
Polytopes; Linear programming; Reverse search; Vertex enumeration; Disjoint paths; Network flow; Simplex method; Degeneracy; Holt-Klee;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:16:y:2008:i:4:d:10.1007_s10878-008-9151-3. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.