The Fixed-Charge Shortest-Path Problem.
Faramroze G. EngineerGeorge L. NemhauserMartin W. P. SavelsberghJin-Hwa SongPublished in: INFORMS J. Comput. (2012)
Keyphrases
- shortest path problem
- fixed charge
- transportation problem
- network design
- shortest path
- network flow problem
- single source
- capacity expansion
- interval data
- combinatorial optimization problems
- fixed cost
- multiple objectives
- directed graph
- valid inequalities
- integer programming
- directed acyclic graph
- network design problem
- communication networks
- mixed integer
- minimum cost
- multistage
- network flow
- capacity planning
- neural network