On Using Cutting Planes in Pseudo-Boolean Optimization.
Vasco M. ManquinhoJoão P. Marques SilvaPublished in: J. Satisf. Boolean Model. Comput. (2006)
Keyphrases
- cutting plane
- pseudo boolean optimization
- lower bound
- upper bound
- cutting plane algorithm
- integer programming problems
- np hard
- valid inequalities
- branch and bound
- optimal solution
- integer programming
- worst case
- multistage stochastic
- dantzig wolfe decomposition
- objective function
- column generation
- lower and upper bounds
- integer program
- constraint satisfaction problems
- mixed integer
- knapsack problem
- dynamic programming