Projected Chvátal-Gomory cuts for mixed integer linear programs.
Pierre BonamiGérard CornuéjolsSanjeeb DashMatteo FischettiAndrea LodiPublished in: Math. Program. (2008)
Keyphrases
- strictly convex
- mixed integer linear programs
- cutting plane algorithm
- valid inequalities
- continuous relaxation
- newton method
- cutting plane
- feasible set
- evaluation function
- knapsack problem
- vehicle routing problem
- mixed integer
- variational inequalities
- genetic algorithm
- integer programming
- convex hull
- integer variables
- linear programming
- upper bound
- objective function