The Fixed Charge Transportation Problem: An Exact Algorithm Based on a New Integer Programming Formulation.
Roberto RobertiEnrico BartoliniAristide MingozziPublished in: Manag. Sci. (2015)
Keyphrases
- fixed charge
- valid inequalities
- integer programming
- transportation problem
- column generation
- lp relaxation
- cutting plane
- mixed integer programming
- linear programming
- np hard
- network design problem
- integer program
- production planning
- lagrangian relaxation
- mixed integer
- network flow
- branch and bound
- constraint programming
- traveling salesman problem
- global constraints
- exact solution
- lower and upper bounds
- branch and bound algorithm
- feasible solution
- linear program
- upper bound
- special case