Pages that link to "Item:Q4644426"
From MaRDI portal
The following pages link to On the Circuit Diameter of Some Combinatorial Polytopes (Q4644426):
Displaying 11 items.
- The diameters of network-flow polytopes satisfy the Hirsch conjecture (Q1785200) (← links)
- On the circuit diameter conjecture (Q1991340) (← links)
- A polyhedral model for enumeration and optimization over the set of circuits (Q2064285) (← links)
- On circuit diameter bounds via circuit imbalances (Q2164689) (← links)
- An implementation of steepest-descent augmentation for linear programs (Q2183215) (← links)
- Circuit walks in integral polyhedra (Q2673232) (← links)
- Constructing Clustering Transformations (Q5150815) (← links)
- Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization (Q5867626) (← links)
- Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q5965567) (← links)
- Circuits in extended formulations (Q6564188) (← links)
- On circuit diameter bounds via circuit imbalances (Q6589764) (← links)