The Hirsch Conjecture for Dual Transportation Polyhedra
From MaRDI portal
Publication:3220350
DOI10.1287/moor.9.4.629zbMath0555.90071OpenAlexW1964903681WikidataQ60174221 ScholiaQ60174221MaRDI QIDQ3220350
Publication date: 1984
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: http://pure.iiasa.ac.at/id/eprint/2373/1/CP-83-009.pdf
Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Polytopes and polyhedra (52Bxx)
Related Items
On the length of simplex paths: The assignment case ⋮ Quadratic diameter bounds for dual network flow polyhedra ⋮ A competitive (dual) simplex method for the assignment problem ⋮ Transportation Problems and Simplicial Polytopes That Are Not Weakly Vertex-Decomposable ⋮ Topics of polyhedral combinatorics in transportation problems with exclusions ⋮ Transportation problems which can be solved by the use of hirsch-paths for the dual problems ⋮ Sparse dual transportation polyhedra: Extreme points and signatures ⋮ The hierarchy of circuit diameters and transportation polytopes ⋮ A Friendly Smoothed Analysis of the Simplex Method ⋮ Algorithms and codes for dense assignment problems: The state of the art ⋮ The Hirsch conjecture for the fractional stable set polytope ⋮ On sub-determinants and the diameter of polyhedra ⋮ Worst case examples of an exterior point algorithm for the assignment problem ⋮ On the Circuit Diameter of Some Combinatorial Polytopes ⋮ The monotonic diameter of the perfect matching and shortest path polytopes ⋮ Signature classes of transportation polytopes ⋮ The diameters of network-flow polytopes satisfy the Hirsch conjecture ⋮ On the shadow simplex method for curved polyhedra ⋮ Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes ⋮ A relaxation column signature method for assignment problems ⋮ Fenchel-type duality for matroid valuations ⋮ Combinatoric classes of the transportation problem and their properties ⋮ An infeasible (exterior point) simplex algorithm for assignment problems
