On the complexity of separating cutting planes for the knapsack polytope.
Alberto Del PiaJeff T. LinderothHaoran ZhuPublished in: Math. Program. (2024)
Keyphrases
- knapsack problem
- cutting plane
- cutting plane algorithm
- dynamic programming
- integer programming problems
- optimal solution
- worst case
- integer programming
- valid inequalities
- optimization problems
- learning algorithm
- multistage stochastic
- mixed integer
- column generation
- computational complexity
- space complexity
- lower bound
- dantzig wolfe decomposition
- greedy algorithm
- upper bound
- evolutionary algorithm
- genetic algorithm