Name
Abstract | ||
|---|---|---|
•An incremental network design problem is studied, where the objective is to maximize the cumulative s-t-flow over a time horizon.•Two mixed integer programming (MIP) formulations are presented.•Two greedy heuristics are described and performance guarantees in special cases are proved.•The MIP formulations as well as the heuristics are compared in computational experiments on randomly generated instances. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.ejor.2014.10.003 | European Journal of Operational Research |
Keywords | DocType | Volume |
Network design,Approximation algorithms,Scheduling | Journal | 242 |
Issue | ISSN | Citations |
1 | 0377-2217 | 11 |
PageRank | References | Authors |
0.65 | 6 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Thomas Kalinowski | 1 | 149 | 22.96 |
| Dmytro Matsypura | 2 | 11 | 2.68 |
| Martin Savelsbergh | 3 | 2624 | 190.83 |