Pages that link to "Item:Q1707378"
From MaRDI portal
The following pages link to Edges versus circuits: a hierarchy of diameters in polyhedra (Q1707378):
Displaying 12 items.
- The circuit diameter of the Klee-Walkup polyhedron (Q322311) (← links)
- Primitive zonotopes (Q724942) (← links)
- The hierarchy of circuit diameters and transportation polytopes (Q1707908) (← 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)
- On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond (Q3457191) (← links)
- On the Circuit Diameter of Some Combinatorial Polytopes (Q4644426) (← links)
- Constructing Clustering Transformations (Q5150815) (← links)
- Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization (Q5867626) (← links)
