6 citations · 17 across the 16 of their papers we have counts for
4 papers · 1 filter
The Hierarchy of Circuit Diameters and Transportation Polytopes
Steffen Borgwardt, Jesús A. De Loera, Elisabeth Finhold +1
The study of the diameter of the graph of polyhedra is a classical problem in the theory of linear programming. While transportation polytopes are at the core of operations researc…
Edges vs Circuits: a Hierarchy of Diameters in Polyhedra
Steffen Borgwardt, Jesús A. De Loera, Elisabeth Finhold
The study of the graph diameter of polytopes is a classical open problem in polyhedral geometry and the theory of linear optimization. In this paper we continue the investigation i…
Quadratic diameter bounds for dual network flow polyhedra
Steffen Borgwardt, Elisabeth Finhold, Raymond Hemmecke
Both the combinatorial and the circuit diameters of polyhedra are of interest to the theory of linear programming for their intimate connection to a best-case performance of linear…
On the circuit diameter of dual transportation polyhedra
Steffen Borgwardt, Elisabeth Finhold, Raymond Hemmecke
In this paper we introduce the circuit diameter of polyhedra, which is always bounded from above by the combinatorial diameter. We consider dual transportation polyhedra defined on…