The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation.
Yixin ZhaoTorbjörn LarssonElina RönnbergPanos M. PardalosPublished in: J. Glob. Optim. (2018)
Keyphrases
- fixed charge
- column generation
- valid inequalities
- transportation problem
- integer programming
- lagrangian relaxation
- set partitioning
- integer program
- optimal solution
- mixed integer programming
- linear programming
- cutting plane algorithm
- cutting plane
- linear programming relaxation
- branch and bound
- linear program
- network design problem
- constraint programming
- np hard
- exact solution
- dual variables
- network design
- approximation algorithms
- mixed integer
- convex hull
- upper bound
- dynamic programming
- capacity expansion
- multistage