Showing math.OCShow all
2 papers · 1 filter
math.OC2026
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-…
math.OC2026
The colored knapsack problem: structural properties and exact algorithms
Fabio Ciccarelli, Alexander Helber, Erik Mühmer
We introduce and study a novel generalization of the classical Knapsack Problem (KP), called the Colored Knapsack Problem (CKP). In this problem, the items are partitioned into cla…