53 citations · 53 across the 1 of their papers we have counts for
1 paper
Thomas Kalinowski, Dmytro Matsypura, Martin W. P. Savelsbergh
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…