arXiv subjects

Martin W. P. Savelsbergh

Publications and source records attributed to Martin W. P. Savelsbergh.

3 recordsLinked to original sources

arXiv2017

Incremental Network Design with Minimum Spanning Trees

Given an edge-weighted graph $G=(V,E)$ and a set $E_0\subset E$, the incremental network design problem with minimum spanning trees asks for a sequence of edges $e'_1,\ldots,e'_T\in E\setminus E_0$ minimizing $\sum_{t=1}^Tw(X_t)$ where $w(X_t)$ is the weight of a minimum spanning tree $X_t$ for the subgraph $(V,E_0\cup\{e'_1,\ldots,e'_t\})$ and $T=\lvert E\setminus E_0\rvert$. We prove that this problem can be solved by a greedy algorithm.

math.CO↗

arXiv2015

A reclaimer scheduling problem arising in coal stockyard management

We study a number of variants of an abstract scheduling problem inspired by the scheduling of reclaimers in the stockyard of a coal export terminal. We analyze the complexity of each of the variants, providing complexity proofs for some and polynomial algorithms for others. For one, especially interesting variant, we also develop a constant factor approximation algorithm.

cs.DS↗

arXiv2014

Incremental Network Design with Maximum Flows

We study an incremental network design problem, where in each time period of the planning horizon an arc can be added to the network and a maximum flow problem is solved, and where the objective is to maximize the cumulative flow over the entire planning horizon. After presenting two mixed integer programming (MIP) formulations for this NP-complete problem, we describe several heuristics and prove performance bounds for some special cases. In a series of computational experiments, we compare the performance of the MIP formulations as well as the heuristics.

cs.DM↗