Pages that link to "Item:Q3457191"
From MaRDI portal
The following pages link to On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond (Q3457191):
Displaying 21 items.
- Lower bounds on the graver complexity of \(M\)-fold matrices (Q259721) (← links)
- Quadratic diameter bounds for dual network flow polyhedra (Q312672) (← links)
- Solving MIPs via scaling-based augmentation (Q1662107) (← links)
- On the circuit diameter conjecture (Q1991340) (← links)
- A note on the approximability of deepest-descent circuit steps (Q2060534) (← 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)
- A scaling algorithm for optimizing arbitrary functions over vertices of polytopes (Q2235141) (← links)
- Heat-bath random walks with Markov bases (Q2407392) (← links)
- Circuit walks in integral polyhedra (Q2673232) (← links)
- On the Circuit Diameter of Some Combinatorial Polytopes (Q4644426) (← links)
- A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs (Q5002764) (← links)
- Constructing Clustering Transformations (Q5150815) (← links)
- A Generalized Simplex Method for Integer Problems Given by Verification Oracles (Q5853568) (← links)
- Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization (Q5867626) (← links)
- A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix (Q6120839) (← links)
- Circuits in extended formulations (Q6564188) (← links)
- Some rapidly mixing hit-and-run samplers for latent counts in linear inverse problems (Q6589568) (← links)
- On circuit diameter bounds via circuit imbalances (Q6589764) (← links)
- Circuit and Graver walks and linear and integer programming (Q6670505) (← links)
