A Rank Lower Bound for Cutting Planes Proofs of Ramsey's Theorem.
Massimo LauriaPublished in: ACM Trans. Comput. Theory (2016)
Keyphrases
- lower bound
- cutting plane
- interactive theorem proving
- upper bound
- cutting plane algorithm
- integer programming problems
- branch and bound algorithm
- branch and bound
- np hard
- optimal solution
- objective function
- lower and upper bounds
- worst case
- valid inequalities
- dantzig wolfe decomposition
- integer programming
- linear programming relaxation
- constraint satisfaction
- genetic algorithm
- scheduling problem