Solving the hazmat transport network design problem.
Erhan ErkutFatma GzaraPublished in: Comput. Oper. Res. (2008)
Keyphrases
- network design problem
- network flow problem
- lagrangian relaxation
- network design
- approximation algorithms
- branch and bound
- benders decomposition
- transportation networks
- integer programming
- mixed integer programming
- minimal cost
- transportation problem
- linear programming
- exact solution
- combinatorial optimization
- mixed integer
- travel time
- lower bound
- optimal solution
- branch and bound algorithm
- valid inequalities
- lp relaxation
- feasible solution
- shortest path
- constraint satisfaction problems
- search algorithm