Cutting Planes and the Parameter Cutwidth
We introduce the parameter cutwidth for the Cutting Planes (CP) system of Gomory and Chvtal. We provide linear lower bounds on cutwidth for two simple polytopes. Considering CP as a propositional refutation system, one can see that the cutwidth of a CNF contradiction F is always bound above by the Resolution width ofF. We provide an example proving that the converse fails: there is an F which has constant cutwidth, but has Resolution width ?(n). Following a standard method for converting an FO sentence ?, without finite models, into a sequence of CNFs, F ?,n , we provide a classification theorem for CP based on the sum cutwidth plus rank. Specifically, the cutwidth + rank of F ?,n is bound by a constant c (depending on ? only) iff ? has no (infinite) models. This result may be seen as a relative of various gap theorems extant in the literature.
cutting planes proof complexity chvatal rank