65 citations · 313 across the 28 of their papers we have counts for
4 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…
Reconstructing biochemical cluster networks
Utz-Uwe Haus, Raymond Hemmecke, Sebastian Pokutta
Motivated by fundamental problems in chemistry and biology we study cluster graphs arising from a set of initial states and a set of transitions/reactions $M\sub…
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…