Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem.
Babacar ThionganeJean-François CordeauBernard GendronPublished in: Comput. Oper. Res. (2015)
Keyphrases
- network design problem
- capacitated fixed charge
- valid inequalities
- network design
- integer programming
- approximation algorithms
- network flow problem
- mixed integer
- mixed integer programming
- traveling salesman problem
- branch and bound
- linear programming
- minimal cost
- transportation networks
- lagrangian relaxation
- convex hull
- cutting plane
- lower and upper bounds
- feasible solution
- primal dual
- integer program