65 citations · 253 across the 47 of their papers we have counts for
5 papers · 1 filter
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…
Multicommodity Flow in Polynomial Time
Raymond Hemmecke, Shmuel Onn, Robert Weismantel
The multicommodity flow problem is NP-hard already for two commodities over bipartite graphs. Nonetheless, using our recent theory of n-fold integer programming and extensions deve…
An analysis of mixed integer linear sets based on lattice point free convex sets
Kent Andersen, Quentin Louveaux, Robert Weismantel
Split cuts are cutting planes for mixed integer programs whose validity is derived from maximal lattice point free polyhedra of the form cal…
Maximal integral simplices with no interior integer points
Kent Andersen, Christian Wagner, Robert Weismantel
In this paper, we consider integral maximal lattice-free simplices. Such simplices have integer vertices and contain integer points in the relative interior of each of their facets…
Nash-equilibria and N-fold integer programming
Raymond Hemmecke, Shmuel Onn, Robert Weismantel
Inspired by a paper of R. W. Rosenthal, we investigate generalized Nash-equilibria of integer programming games. We show that generalized Nash-equilibria always exist and are relat…