Kalinowski, Thomas; Matsypura, Dmytro; Savelsbergh, … - In: European Journal of Operational Research 242 (2015) 1, pp. 51-62
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...