Recommendations
- A polyhedral model for enumeration and optimization over the set of circuits
- On the circuit diameter conjecture
- On the circuit diameter of some combinatorial polytopes
- Pivot rules for circuit-augmentation algorithms in linear optimization
- Edge-directions of standard polyhedra with applications to network flows
Cites work
- A counterexample to the Hirsch conjecture
- A polynomial oracle-time algorithm for convex integer minimization
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- Adjacency on polymatroids
- Criss-cross methods: A fresh view on pivot algorithms
- Decomposition theorems for linear programs
- Edges versus circuits: a hierarchy of diameters in polyhedra
- Good clusterings have large volume
- scientific article; zbMATH DE number 3294139 (Why is no real title available?)
- scientific article; zbMATH DE number 3365043 (Why is no real title available?)
- New Finite Pivoting Rules for the Simplex Method
- Nonlinear discrete optimization. An algorithmic theory
- On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond
- On the circuit diameter conjecture
- On the circuit diameter of dual transportation polyhedra
- On the circuit diameter of some combinatorial polytopes
- On the diameter of partition polytopes and vertex-disjoint cycle cover
- On the foundations of linear and integer linear programming I
- Oriented Matroids
- Quadratic diameter bounds for dual network flow polyhedra
- Random walks, totally unimodular matrices, and a randomised dual simplex algorithm
- The \(d\)-step conjecture for polyhedra of dimension \(d<6\)
- The circuit diameter of the Klee-Walkup polyhedron
- The hierarchy of circuit diameters and transportation polytopes
- The Hirsch conjecture is true for (0,1)-polytopes
Cited in
(11)- A polyhedral model for enumeration and optimization over the set of circuits
- Sublinear circuits for polyhedral sets
- An implementation of steepest-descent augmentation for linear programs
- Constructing Clustering Transformations
- Circuit Imbalance Measures and Linear Programming
- Circuit Walks in Integral Polyhedra
- Circuits in extended formulations
- On combinatorial network flows algorithms and circuit augmentation for pseudoflows
- On the hardness of short and sign-compatible circuit walks
- Combinatorics of generalized parking-function polytopes
- On the circuit diameter conjecture for counterexamples to the Hirsch conjecture
This page was built for publication: Circuit walks in integral polyhedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2673232)
