A polyhedral model for enumeration and optimization over the set of circuits
From MaRDI portal
Publication:2064285
DOI10.1016/j.dam.2019.07.025zbMath1483.90075arXiv1811.00444OpenAlexW2969997982WikidataQ127357409 ScholiaQ127357409MaRDI QIDQ2064285
Steffen Borgwardt, Charles Viss
Publication date: 5 January 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.00444
Related Items
Inapproximability of shortest paths on perfect matching polytopes, Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- An application of simultaneous diophantine approximation in combinatorial optimization
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- Variation of cost functions in integer programming
- On the positive sums property and the computation of Graver test sets
- Edges versus circuits: a hierarchy of diameters in polyhedra
- Decomposition theorems for linear programs
- \(n\)-fold integer programming in cubic time
- On the circuit diameter conjecture
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- 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 Finding Primal- and Dual-Optimal Bases
- On the foundations of linear and integer linear programming I
- On the Circuit Diameter of Some Combinatorial Polytopes
- Vector Space Decomposition for Solving Large-Scale Linear Programs
- Generating all vertices of a polyhedron is hard
