Pages that link to "Item:Q858109"
From MaRDI portal
The following pages link to A linear bound on the diameter of the transportation polytope (Q858109):
Displaying 20 items.
- On the closest point to the origin in transportation polytopes (Q299056) (← links)
- An explicit bound on the transportation cost distance (Q380692) (← links)
- The Hirsch conjecture for the fractional stable set polytope (Q463733) (← links)
- On the shadow simplex method for curved polyhedra (Q728496) (← links)
- Graphs of transportation polytopes (Q1040845) (← links)
- An O(\(n\)) bound for the diameter of transshipment polytopes (Q1195869) (← links)
- The monotonic diameter of traveling salesman polytopes (Q1271383) (← links)
- The hierarchy of circuit diameters and transportation polytopes (Q1707908) (← links)
- The diameters of network-flow polytopes satisfy the Hirsch conjecture (Q1785200) (← links)
- The diameter of the stable marriage polytope: bounding from below (Q2305917) (← links)
- Polyhedral combinatorics of multi-index axial transportation problems (Q2482774) (← links)
- Transportation problems and simplicial polytopes that are not weakly vertex-decomposable (Q2925352) (← links)
- Obstructions to weak decomposability for simplicial polytopes (Q3190213) (← links)
- Random walks on the vertices of transportation polytopes with constant number of sources (Q3608299) (← links)
- (Q3691711) (← links)
- On the Circuit Diameter of Some Combinatorial Polytopes (Q4644426) (← links)
- A Friendly Smoothed Analysis of the Simplex Method (Q5129232) (← links)
- On sub-determinants and the diameter of polyhedra (Q5891422) (← links)
- Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q5965566) (← links)
- Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q5965568) (← links)
