Preprocessing and cutting planes with conflict graphs.
Samuel Souza BritoHaroldo Gambini SantosPublished in: Comput. Oper. Res. (2021)
Keyphrases
- cutting plane
- preprocessing
- cutting plane algorithm
- integer programming problems
- lower bound
- integer programming
- knapsack problem
- multistage stochastic
- column generation
- mixed integer
- dantzig wolfe decomposition
- valid inequalities
- integer program
- feature extraction
- branch and bound
- constraint programming
- linear program
- computationally expensive
- constraint satisfaction
- graphical models
- np hard
- search algorithm
- optimal solution