Circuit walks in integral polyhedra
From MaRDI portal
Publication:2673232
DOI10.1016/j.disopt.2019.100566OpenAlexW3000602106WikidataQ126342304 ScholiaQ126342304MaRDI QIDQ2673232
Steffen Borgwardt, Charles Viss
Publication date: 9 June 2022
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1712.01933
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Integer programming (90C10) Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items (2)
An implementation of steepest-descent augmentation for linear programs ⋮ Constructing Clustering Transformations
Cites Work
- Unnamed Item
- Unnamed Item
- Quadratic diameter bounds for dual network flow polyhedra
- The circuit diameter of the Klee-Walkup polyhedron
- On the diameter of partition polytopes and vertex-disjoint cycle cover
- A counterexample to the Hirsch conjecture
- A polynomial oracle-time algorithm for convex integer minimization
- Nonlinear discrete optimization. An algorithmic theory
- Random walks, totally unimodular matrices, and a randomised dual simplex algorithm
- Criss-cross methods: A fresh view on pivot algorithms
- Edges versus circuits: a hierarchy of diameters in polyhedra
- The hierarchy of circuit diameters and transportation polytopes
- Decomposition theorems for linear programs
- The Hirsch conjecture is true for (0,1)-polytopes
- On the circuit diameter conjecture
- The \(d\)-step conjecture for polyhedra of dimension \(d<6\)
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- Adjacency on polymatroids
- On the Circuit Diameter of Dual Transportation Polyhedra
- On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond
- On the foundations of linear and integer linear programming I
- New Finite Pivoting Rules for the Simplex Method
- On the Circuit Diameter of Some Combinatorial Polytopes
- Oriented Matroids
- Good Clusterings Have Large Volume
- On sub-determinants and the diameter of polyhedra
This page was built for publication: Circuit walks in integral polyhedra
