Scheduling unit time arc shutdowns to maximize network flow over time: Complexity results.
Natashia BolandReena KapoorSimranjit KaurThomas KalinowskiPublished in: Networks (2014)
Keyphrases
- network flow
- network flow problem
- minimum cost
- linear programming
- optimization model
- traffic control
- capacity constraints
- integer programming
- scheduling problem
- scheduling algorithm
- bipartite graph
- resource constraints
- resource allocation
- parallel processors
- set cover
- multi objective
- computational complexity
- optimal solution