65 citations · 313 across the 28 of their papers we have counts for
14 papers · 1 filter
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…
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…
N-fold integer programming in cubic time
Raymond Hemmecke, Shmuel Onn, Lyubov Romanchuk
N-fold integer programming is a fundamental problem with a variety of natural applications in operations research and statistics. Moreover, it is universal and provides a new, vari…
Learning restricted Bayesian network structures
Raymond Hemmecke, Silvia Lindner, Milan Studený
Bayesian networks are basic graphical models, used widely both in statistics and artificial intelligence. These statistical models of conditional independence structure are describ…
A polynomial-time algorithm for optimizing over N-fold 4-block decomposable integer programs
Raymond Hemmecke, Matthias Köppe, Robert Weismantel
In this paper we generalize N-fold integer programs and two-stage integer programs with N scenarios to N-fold 4-block decomposable integer programs. We show that for fixed blocks b…