Pages that link to "Item:Q1825756"
From MaRDI portal
The following pages link to The Hirsch conjecture is true for (0,1)-polytopes (Q1825756):
Displaying 33 items.
- On the diameter of cut polytopes (Q271649) (← links)
- On the diameter of lattice polytopes (Q282757) (← links)
- Quadratic diameter bounds for dual network flow polyhedra (Q312672) (← links)
- On the diameter of partition polytopes and vertex-disjoint cycle cover (Q378108) (← links)
- Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q384506) (← links)
- The Hirsch conjecture for the fractional stable set polytope (Q463733) (← links)
- Geometry, complexity, and combinatorics of permutation polytopes (Q690026) (← links)
- Primitive zonotopes (Q724942) (← links)
- On the shadow simplex method for curved polyhedra (Q728496) (← links)
- On the diameter of convex polytopes (Q1193432) (← links)
- Random walks, totally unimodular matrices, and a randomised dual simplex algorithm (Q1330890) (← links)
- Lattice-free polytopes and their diameter (Q1346126) (← links)
- The hierarchy of circuit diameters and transportation polytopes (Q1707908) (← links)
- Improved bounds on the diameter of lattice polytopes (Q1747971) (← links)
- The diameters of network-flow polytopes satisfy the Hirsch conjecture (Q1785200) (← links)
- Adjacency on combinatorial polyhedra (Q1842660) (← links)
- Simple 0/1-polytopes (Q1964656) (← links)
- On the circuit diameter conjecture (Q1991340) (← links)
- Short simplex paths in lattice polytopes (Q2117352) (← links)
- Distance between vertices of lattice polytopes (Q2174873) (← links)
- A scaling algorithm for optimizing arbitrary functions over vertices of polytopes (Q2235141) (← links)
- Elementary moves on lattice polytopes (Q2299641) (← links)
- An asymptotically improved upper bound on the diameter of polyhedra (Q2324633) (← links)
- Improving bounds on the diameter of a polyhedron in high dimensions (Q2359957) (← links)
- Circuit walks in integral polyhedra (Q2673232) (← links)
- On the Number of Solutions Generated by the Simplex Method for LP (Q2948780) (← links)
- On the Relative Complexity of 15 Problems Related to 0/1-Integer Programming (Q2971619) (← links)
- (Q5075806) (← links)
- The diameter of lattice zonotopes (Q5113413) (← links)
- Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q5965566) (← links)
- Monotone diameter of bisubmodular polyhedra (Q6063788) (← links)
- Primitive point packing (Q6074967) (← links)
- On the Combinatorial Diameters of Parallel and Series Connections (Q6188515) (← links)
