32 search results - page 1 / 7 » On the complexity of cutting plane proofs using split cuts |
ECCC
2008
13 years 4 months ago
2008
SIAMCOMP
2000
13 years 4 months ago
2000
An exponential lower bound for the size of tree-like cutting planes refutations of a certain family of conjunctive normal form (CNF) formulas with polynomial size resolution refuta...
ISSAC
2005
Springer
13 years 10 months ago
2005
Springer
Given an elementary function with algebraic branch cuts, we show how to decide which sheet of the associated Riemann surface we are on at any given point. We do this by establishi...
IOR
2011
12 years 11 months ago
2011
In this paper, we give a finite disjunctive programming procedure to obtain the convex hull of general mixed-integer linear programs (MILP) with bounded integer variables. We prop...
AMAI
2004
Springer
13 years 10 months ago
2004
Springer
This paper studies the relative proof complexity of variations of a tableau method for Boolean circuit satisfiability checking obtained by restricting the use of the cut rule in s...