Circuit walks in integral polyhedra
DOI10.1016/J.DISOPT.2019.100566OpenAlexW3000602106WikidataQ126342304 ScholiaQ126342304MaRDI QIDQ2673232FDOQ2673232
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
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
Linear programming (90C05) Integer programming (90C10) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Cites Work
- Oriented Matroids
- 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
- Title not available (Why is that?)
- A polynomial oracle-time algorithm for convex integer minimization
- The Hirsch conjecture is true for (0,1)-polytopes
- On the diameter of partition polytopes and vertex-disjoint cycle cover
- Adjacency on polymatroids
- On sub-determinants and the diameter of polyhedra
- The \(d\)-step conjecture for polyhedra of dimension \(d<6\)
- Decomposition theorems for linear programs
- New Finite Pivoting Rules for the Simplex Method
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- Quadratic diameter bounds for dual network flow polyhedra
- The circuit diameter of the Klee-Walkup polyhedron
- On the Circuit Diameter of Dual Transportation Polyhedra
- A counterexample to the Hirsch conjecture
- Nonlinear discrete optimization. An algorithmic theory
- Edges versus circuits: a hierarchy of diameters in polyhedra
- Random walks, totally unimodular matrices, and a randomised dual simplex algorithm
- Criss-cross methods: A fresh view on pivot algorithms
- Title not available (Why is that?)
- The hierarchy of circuit diameters and transportation polytopes
- On the Circuit Diameter of Some Combinatorial Polytopes
- On the circuit diameter conjecture
- Good Clusterings Have Large Volume
Cited In (4)
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)
