On the Generation of Cutting Planes which Maximize the Bound Improvement.
Stefano ConiglioMartin TievesPublished in: SEA (2015)
Keyphrases
- cutting plane
- lower bound
- integer programming problems
- cutting plane algorithm
- integer programming
- upper bound
- column generation
- integer program
- knapsack problem
- multistage stochastic
- worst case
- mixed integer
- reinforcement learning
- branch and bound
- linear programming relaxation
- dantzig wolfe decomposition
- lower and upper bounds
- primal dual
- supply chain
- evolutionary algorithm
- optimal solution