1 citations · 1 across the 1 of their papers we have counts for
4 papers · 1 filter
Fast Combinatorial Algorithms for Efficient Sortation
Madison Van Dyk, Kim Klause, Jochen Koenemann +1
Modern parcel logistic networks are designed to ship demand between given origin, destination pairs of nodes in an underlying directed network. Efficiency dictates that volume need…
Sparse dynamic discretization discovery via arc-dependent time discretizations
Madison Van Dyk, Jochen Koenemann
While many time-dependent network design problems can be formulated as time-indexed formulations with strong relaxations, the size of these formulations depends on the discretizati…
Dynamic discretization discovery under hard node storage constraints
Madison Van Dyk, Jochen Koenemann
The recently developed dynamic discretization discovery (DDD) is a powerful method that allows many time-dependent problems to become more tractable. While DDD has been applied to…
Integrality Gap of the Hypergraphic Relaxation of Steiner Trees: a short proof of a 1.55 upper bound
Deeparnab Chakrabarty, Jochen Koenemann, David Pritchard
Recently Byrka, Grandoni, Rothvoss and Sanita (at STOC 2010) gave a 1.39-approximation for the Steiner tree problem, using a hypergraph-based linear programming relaxation. They al…