3 citations · 3 across the 3 of their papers we have counts for
4 papers
Real-time Optimization of Transport Chains for Single Wagon Load Railway Transport
Carsten Moldenhauer, Philipp Germann, Cedric Heimhofer +2
The freight branch of the Swiss national railways, SBB Cargo, offers customers to ship single or few wagons within its wagon load transportation system (WLV). In this system, wagon…
Approximation algorithms for node-weighted prize-collecting Steiner tree problems on planar graphs
Jarosław Byrka, Mateusz Lewandowski, Carsten Moldenhauer
We study the prize-collecting version of the Node-weighted Steiner Tree problem (NWPCST) restricted to planar graphs. We give a new primal-dual Lagrangian-multiplier-preserving (LM…
On largest volume simplices and sub-determinants
Marco Di Summa, Friedrich Eisenbrand, Yuri Faenza +1
We show that the problem of finding the simplex of largest volume in the convex hull of points in can be approximated with a factor of in polyn…
Balanced Interval Coloring
Antonios Antoniadis, Falk Hüffner, Pascal Lenzner +2
We consider the discrepancy problem of coloring intervals with colors such that at each point on the line, the maximal difference between the number of intervals of any two…