Strong valid inequalities for orthogonal disjunctions and bilinear covering sets.
Mohit TawarmalaniJean-Philippe P. RichardKwanghun ChungPublished in: Math. Program. (2010)
Keyphrases
- valid inequalities
- integer programming
- cutting plane
- linear programming
- traveling salesman problem
- mixed integer programming
- mixed integer
- mixed integer linear programs
- cutting plane algorithm
- convex hull
- lower and upper bounds
- randomly generated problems
- feasible solution
- network design problem
- column generation
- primal dual
- linear programming relaxation
- integer programming formulation
- capacitated fixed charge
- integer program
- continuous variables
- randomly generated
- facet defining inequalities
- network flow
- production planning
- probability distribution
- computational complexity
- optimal solution