Graphs of transportation polytopes
From MaRDI portal
Publication:1040845
DOI10.1016/j.jcta.2009.03.010zbMath1229.05190arXiv0709.2189OpenAlexW1989756312MaRDI QIDQ1040845
Jesús A. De Loera, Shmuel Onn, Francisco Santos, Edward D. Kim
Publication date: 26 November 2009
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0709.2189
Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Paths and cycles (05C38)
Related Items
On the closest point to the origin in transportation polytopes, More bounds on the diameters of convex polytopes, Cycle-based reducibility of multi-index transport-type systems of linear inequalities, On the diameter of partition polytopes and vertex-disjoint cycle cover, Multiindex transportation problems with 2-embedded structure, The value function of a transportation problem, A Lower Bound Technique for Triangulations of Simplotopes, The hierarchy of circuit diameters and transportation polytopes, A Friendly Smoothed Analysis of the Simplex Method, On sub-determinants and the diameter of polyhedra, Three-index linear programs with nested structure, Constructing Clustering Transformations, Multistationarity in the space of total concentrations for systems that admit a monomial parametrization, Multi-index transport problems with decomposition structure, 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, Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes, The diameter of the stable marriage polytope: bounding from below
Uses Software
Cites Work
- A Network Algorithm for Performing Fisher's Exact Test in r × c Contingency Tables
- Signature classes of transportation polytopes
- Constructions and complexity of secondary polytopes
- Duality and minors of secondary polyhedra
- A linear bound on the diameter of the transportation polytope
- Triangulations. Structures for algorithms and applications
- Conditions for the existence of solutions of the three-dimensional planar transportation problem
- On the diameter of convex polytopes
- Approximation algorithms for multi-index transportation problems with decomposable costs
- On properties of multi-dimensional statistical tables
- Convex combinatorial optimization
- The polytope of all triangulations of a point configuration
- Markov bases of three-way tables are arbitrarily complicated
- The Vector Partition Problem for Convex Objective Functions
- A quasi-polynomial bound for the diameter\\of graphs of polyhedra
- Three-dimensional Statistical Data Security Problems
- Lectures on Polytopes
- The Complexity of Three-Way Statistical Tables
- Oriented Matroids
- The Stable Allocation (or Ordinal Transportation) Problem
- All Linear and Integer Programs Are Slim 3‐Way Transportation Programs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
