Valid Inequalities for the Pooling Problem with Binary Variables.
Claudia D'AmbrosioJeff T. LinderothJames R. LuedtkePublished in: IPCO (2011)
Keyphrases
- valid inequalities
- binary variables
- mixed integer programming
- integer programming
- traveling salesman problem
- linear programming
- mixed integer
- linear programming relaxation
- cutting plane
- feasible solution
- column generation
- convex hull
- integer program
- lower and upper bounds
- continuous variables
- primal dual
- lagrangian relaxation
- linear program
- lower bound
- lot sizing
- ant colony optimization
- np hard
- upper bound