Tight rank lower bounds for the Sherali-Adams proof system.
Stefan S. DantchevBarnaby MartinMark Nicholas Charles RhodesPublished in: Theor. Comput. Sci. (2009)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- worst case
- lower and upper bounds
- optimal solution
- np hard
- branch and bound
- modal logic
- objective function
- vc dimension
- lower bounding
- mixed integer
- rank order
- cutting plane
- optimal cost
- upper and lower bounds
- lagrangian relaxation
- max sat
- scheduling problem
- clause learning