Pages that link to "Item:Q1785200"
From MaRDI portal
The following pages link to The diameters of network-flow polytopes satisfy the Hirsch conjecture (Q1785200):
Displaying 13 items.
- On Dantzig figures from graded lexicographic orders (Q1744737) (← links)
- On the circuit diameter conjecture (Q1991340) (← links)
- A note on the approximability of deepest-descent circuit steps (Q2060534) (← links)
- A note on the diameter of convex polytope (Q2217504) (← links)
- On the Circuit Diameter of Some Combinatorial Polytopes (Q4644426) (← links)
- On the Length of Monotone Paths in Polyhedra (Q5009332) (← links)
- Formalizing the Face Lattice of Polyhedra (Q5049001) (← links)
- (Q5094138) (← links)
- On the Computation of Kantorovich--Wasserstein Distances Between Two-Dimensional Histograms by Uncapacitated Minimum Cost Flows (Q5124004) (← links)
- A Friendly Smoothed Analysis of the Simplex Method (Q5129232) (← links)
- Monotone diameter of bisubmodular polyhedra (Q6063788) (← links)
- Adjacencies on random ordering polytopes and flow polytopes (Q6134082) (← links)
- On the Combinatorial Diameters of Parallel and Series Connections (Q6188515) (← links)
