A Rank Lower Bound for Cutting Planes Proofs of Ramsey's Theorem.
Massimo LauriaPublished in: SAT (2013)
Keyphrases
- lower bound
- cutting plane
- interactive theorem proving
- upper bound
- cutting plane algorithm
- integer programming problems
- branch and bound
- branch and bound algorithm
- np hard
- worst case
- lower and upper bounds
- objective function
- linear programming relaxation
- optimal solution
- valid inequalities
- knapsack problem
- special case
- search space
- search algorithm