1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.DM2023
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…
cs.DM2023
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…
cs.DM2023★ 1 cited
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…