A Cutting-Plane Neighborhood Structure for Fixed-Charge Capacitated Multicommodity Network Design Problem.
Masoud YaghiniMohammad KarimiMohadeseh RahbarMohammad Hassan SharifitabarPublished in: INFORMS J. Comput. (2015)
Keyphrases
- cutting plane
- network design problem
- valid inequalities
- network flow problem
- mixed integer
- integer programming
- column generation
- lower bound
- linear program
- mixed integer programming
- branch and bound
- lot sizing
- integer program
- transportation problem
- knapsack problem
- network design
- convex hull
- linear programming
- lp relaxation
- feasible solution
- lagrangian relaxation
- search algorithm
- optimal solution
- objective function
- approximation algorithms
- network flow
- upper bound
- computational complexity