Cutting planes and the parameter cutwidth


Dantchev, S. and Martin, B. 2011. Cutting planes and the parameter cutwidth. Theory of Computing Systems. 51 (1), pp. 50-64.
TitleCutting planes and the parameter cutwidth
AuthorsDantchev, S. and Martin, B.

We introduce the parameter cutwidth for the Cutting Planes (CP) system of Gomory and Chvátal. 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 of F. 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) if ψ has no (infinite) models. This result may be seen as a relative of various gap theorems extant in the literature.

Research GroupFoundations of Computing group
PublisherSpringer Verlag
JournalTheory of Computing Systems
Publication dates
Online06 Dec 2011
Publication process dates
Deposited20 Dec 2012
Output statusPublished
Digital Object Identifier (DOI)
Permalink -

  • 18
    total views
  • 0
    total downloads
  • 0
    views this month
  • 0
    downloads this month

Export as