23 citations · 23 across the 2 of their papers we have counts for
4 papers
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…
A -Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs
Andreas Emil Feldmann, Wai Shing Fung, Jochen Könemann +1
Graphs with bounded highway dimension were introduced by Abraham et al. [SODA 2010] as a model of transportation networks. We show that any such graph can be embedded into a distri…
On Column-restricted and Priority Covering Integer Programs
Deeparnab Chakrabarty, Elyot Grant, Jochen Koenemann
In a column-restricted covering integer program (CCIP), all the non-zero entries of any column of the constraint matrix are equal. Such programs capture capacitated versions of cov…
On Generalizations of Network Design Problems with Degree Bounds
Nikhil Bansal, Rohit Khandekar, Jochen Konemann +2
Iterative rounding and relaxation have arguably become the method of choice in dealing with unconstrained and constrained network design problems. In this paper we extend the scope…