Comparison of the formulations for a hub-and-spoke network design problem under congestion.
Ramez KianKamyar KargarPublished in: Comput. Ind. Eng. (2016)
Keyphrases
- network design problem
- valid inequalities
- approximation algorithms
- benders decomposition
- network design
- branch and bound
- mixed integer programming
- transportation networks
- minimal cost
- linear programming
- column generation
- integer program
- mixed integer
- feasible solution
- lagrangian relaxation
- neural network
- travel time
- integer programming
- distributed systems
- graphical models
- np hard