Transportation Problems and Simplicial Polytopes That Are Not Weakly Vertex-Decomposable

References

• Balinski ML. The Hirsch conjecture for dual transportation polyhedra. Math. Oper. Res. (1984) 9(4):629–633doi:10.1287/moor.9.4.629. http://dx.doi.org/10.1287/moor.9.4.629Link, Google Scholar
• Barnette D. An upper bound for the diameter of a polytope. Discrete Math. (1974) 10:9–13Crossref, Google Scholar
• Brightwell G, van den Heuvel J, Stougie L. A linear bound on the diameter of the transportation polytope. Combinatorica (2006) 26(2):133–139doi:10.1007/s00493-006-0010-5. http://dx.doi.org/10.1007/s00493-006-0010-5Crossref, Google Scholar
• De Loera JA. New insights into the complexity and geometry of linear optimization. OPTIMA, Newsletter Math. Optim. Soc. (2011) 87:1–13 http://www.mathprog.org/Optima-Issues/optima87.pdfGoogle Scholar
• Kalai G, Kleitman D. A quasi-polynomial bound for the diameter of graphs of polyhedra. Bull. Amer. Math. Soc. (N.S.) (1992) 26(2):315–316Crossref, Google Scholar
• Kim ED. Geometric combinatorics of transportation polytopes and the behavior of the simplex method. (2010) . Ph.D. thesis, University of California, Davis. http://front.math.ucdavis.edu/1006.2416Google Scholar
• Kim ED, Santos F. An update on the Hirsch conjecture. Jahresber. Dtsch. Math.-Ver. (2010) 112(2):73–98Crossref, Google Scholar
• Klee V, Kleinschmidt P. The d-step conjecture and its relatives. Math. Oper. Res. (1987) 12(4):718–755Link, Google Scholar
• Klee V, Witzgall C. Facets and vertices of transportation polytopes. Mathematics of the Decision Sciences, Part I (Seminar, Stanford, Calif., 1967) (1968) (Amer. Math. Soc., Providence, RI) 257–282Google Scholar
• Larman D. Paths of polytopes. Proc. London Math. Soc. (1970) s3–20(1):161–178Crossref, Google Scholar
• Lockeberg ER. Refinements in boundary complexes of polytopes. (1977) . Ph.D. thesis, University College LondonGoogle Scholar
• Matschke B, Santos F, Weibel C. The width of 5-dimensional prismatoids. (2012) . http://arxiv.org/abs/1202.4701Google Scholar
• Provan S, Billera L. Decompositions of simplicial complexes related to diameters of convex polyhedra. Math. Oper. Res. (1980) 5(4):576–594Link, Google Scholar
• Santos F. A counterexample to the Hirsch conjecture. Ann. Math. (2012) 176(1):383–412Crossref, Google Scholar
• Stanley RP. Combinatorics and Commutative Algebra (1996) 2nd ed.(Birkhäuser, Boston) Google Scholar
• Stein WA, et al.Sage Mathematics Software (Version 4.7.1) (2011) . The Sage Development Team. http://www.sagemath.orgGoogle Scholar
• Todd MJ. The many facets of linear programming. Math. Program. (2002) 91(3):417–436Crossref, Google Scholar
• Yemelichev VA, Kovalëv MM, Kravtsov MK. Polytopes, Graphs and Optimisation (1984) (Cambridge University Press, Cambridge, UK) . Translated from the Russian by Lawden GHGoogle Scholar
• Ziegler GM. Lectures on Polytopes (1995) 152(Springer-Verlag, New York) Graduate Texts in MathematicsCrossref, Google Scholar