65 citations · 313 across the 28 of their papers we have counts for
31 papers
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 Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds-Karp to Bland and Beyond
Jesus A. De Loera, Raymond Hemmecke, Jon Lee
Motivated by Bland's linear-programming generalization of the renowned Edmonds-Karp efficient refinement of the Ford-Fulkerson maximum-flow algorithm, we discuss three closely-rela…
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…
On the Connectivity of Fiber Graphs
Raymond Hemmecke, Tobias Windisch
We consider the connectivity of fiber graphs with respect to Gröbner basis and Graver basis moves. First, we present a sequence of fiber graphs using moves from a Gröbner basis and…
Lower bounds on the Graver complexity of -fold matrices
Elisabeth Finhold, Raymond Hemmecke
In this paper, we present a construction that turns certain relations on Graver basis elements of an -fold matrix into relations on Graver basis elements of an …
Graver basis and proximity techniques for block-structured separable convex integer minimization problems
Raymond Hemmecke, Matthias Köppe, Robert Weismantel
We consider N-fold 4-block decomposable integer programs, which simultaneously generalize N-fold integer programs and two-stage stochastic integer programs with N scenarios. In pre…