4 papers
Minimum-Cost Flows Over Time
Miriam Schlöter, Robert Weismantel
In this paper we show that every maximum minimum-cost flow over time problem has an optimal solution with a repeated structure if the given time horizon is large enough.
A Faster Algorithm for Quickest Transshipments via an Extended Discrete Newton Method
Miriam Schlöter, Martin Skutella, Khai Van Tran
The Quickest Transshipment Problem is to route flow as quickly as possible from sources with supplies to sinks with demands in a network with capacities and transit times on the ar…
Constructing lattice-free gradient polyhedra in dimension two
Joseph Paat, Miriam Schlöter, Emily Speakman
Lattice-free gradient polyhedra can be used to certify optimality for mixed-integer convex minimization models. We consider how to construct these polyhedra for unconstrained model…
The Integrality Number of an Integer Program
Joseph Paat, Miriam Schlöter, Robert Weismantel
We introduce the integrality number of an integer program (IP) in inequality form. Roughly speaking, the integrality number is the smallest number of integer constraints needed to…