Improving Cutting Plane Generation with 0-1 Inequalities by Bi-criteria Separation.
Edoardo AmaldiStefano ConiglioStefano GualandiPublished in: SEA (2010)
Keyphrases
- cutting plane
- bicriteria
- cutting plane algorithm
- integer linear programming
- knapsack problem
- valid inequalities
- mixed integer
- column generation
- integer programming
- efficient solutions
- lower bound
- integer program
- optimal solution
- optimization problems
- np hard
- combinatorial optimization problems
- dynamic programming
- upper bound
- multiple objectives
- flowshop