Computing Valid Inequalities for General Integer Programs using an Extension of Maximal Dual Feasible Functions to Negative Arguments.
Jürgen RietzCláudio AlvesJosé M. Valério de CarvalhoFrançois ClautiauxPublished in: ICORES (2012)
Keyphrases
- valid inequalities
- integer program
- cutting plane
- integer programming
- column generation
- linear programming
- special case
- traveling salesman problem
- mixed integer programming
- linear programming relaxation
- feasible solution
- primal dual
- lower and upper bounds
- linear program
- mixed integer
- network design problem
- convex hull
- lagrangian relaxation
- lower bound
- knapsack problem
- np hard
- objective function