The problem of minimizing the difference of two convex functions is called polyhedral d.c. optimization problem if at least one of the two component functions is polyhedral. We characterize the existence of global optimal solutions of polyhedral d.c. optimization problems. This result is used to...

The multiple traveling salespersons problem with moving targets is a generalization of the classical traveling salespersons problem, where the targets (nodes or objects) are moving over time. Additionally, for each target a visibility time window is given. The task is to find routes for several...

In order to strengthen competitiveness, the pool of available network sites in supply chains of processing industries with 24/7 operations should be adjusted permanently. However, an integration of additional sites is to be assessed thoroughly by the network managers as an exact coordination...

Dynamic treatment regimes are treatment allocations tailored to heterogeneous individuals. The optimal dynamic treatment regime is a regime that maximizes counterfactual welfare. We introduce a framework in which we can partially learn the optimal dynamic regime from observational data, relaxing...

Energy system models are limited in their scope and level of disaggregation by the availability offast computing hardware. While improvements in hardware and solver developments have led toan increasing size of solvable models, problems with high temporal and geographical resolutionremain...