New valid inequalities for the fixed-charge and single-node flow polytopes.
Adam N. LetchfordGeorgia SouliPublished in: Oper. Res. Lett. (2019)
Keyphrases
- valid inequalities
- fixed charge
- integer programming
- traveling salesman problem
- mixed integer
- mixed integer programming
- network flow problem
- convex hull
- linear programming
- network design problem
- cutting plane
- lower and upper bounds
- feasible solution
- integer program
- column generation
- primal dual
- transportation problem
- lower bound
- network design
- lagrangian relaxation
- constraint programming
- lp relaxation
- linear program
- np hard
- continuous variables
- convex optimization
- upper bound
- scheduling problem
- computational complexity