19 citations · 22 across the 4 of their papers we have counts for
5 papers
Optimal Refinement in Dynamic Discretisation Discovery for Continuous-Time Service Network Design
Alexander Helber, Oliver Bachtler, Tom Wüllner
Dynamic Discretisation Discovery (DDD) is a framework for solving a problem by iteratively solving and refining a relaxed version of the problem. DDD is the basis for state-of-the-…
A dual view of Roman Domination: The 2-limited packing problem
Oliver Bachtler, Sven O. Krumke, Helena Weiß
We consider the 2-limited packing problem: for a graph one seeks to find a maximum cardinality subset , such that, for all , the closed neighbourhoo…
Almost Disjoint Paths and Separating by Forbidden Pairs
Oliver Bachtler, Tim Bergner, Sven O. Krumke
By Menger's theorem the maximum number of arc-disjoint paths from a vertex s to a vertex t in a directed graph equals the minumum number of arcs needed to disconnect s and t, i.e.,…
Towards obtaining a 3-Decomposition from a perfect Matching
Oliver Bachtler, Sven O. Krumke
A decomposition of a graph is a set of subgraphs whose edges partition those of . The 3-decomposition conjecture posed by Hoffmann-Ostenhof in 2011 states that every connected c…
Robust Single Machine Makespan Scheduling with Release Date Uncertainty
Oliver Bachtler, Sven O. Krumke, Huy Minh Le
This paper addresses the robust single machine makespan scheduling with uncertain release dates of the jobs. The release dates take values within know intervals. We use the concept…