Lower Bounds for Monotone Real Circuit Depth and Formula Size and Tree-like Cutting Planes
Jan JohannsenPublished in: Electron. Colloquium Comput. Complex. (1997)
Keyphrases
- cutting plane
- lower bound
- upper bound
- cutting plane algorithm
- branch and bound algorithm
- branch and bound
- integer programming
- integer programming problems
- linear programming relaxation
- mixed integer
- worst case
- objective function
- tree search
- column generation
- np hard
- knapsack problem
- lower and upper bounds
- integer program
- valid inequalities
- optimal solution
- boolean functions
- b tree
- lagrangian relaxation
- computationally expensive
- special case
- learning algorithm