IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v42y2017i4p1106-1134.html
   My bibliography  Save this article

On the Width of Semialgebraic Proofs and Algorithms

Author

Listed:
  • Alexander Razborov

    (Departments of Mathematics and Computer Science, University of Chicago, Chicago, Illinois 60637; and Steklov Mathematical Institute, Moscow, Russia 117418)

Abstract

In this paper we study width of semialgebraic proof systems and various cut-based procedures in integer programming. We focus on two important systems: Gomory-Chvátal cutting planes and Lovász-Schrijver lift-and-project procedures. We develop general methods for proving width lower bounds and apply them to random k-CNFs and several popular combinatorial principles, like the perfect matching principle and Tseitin tautologies. We also show how to apply our methods to various combinatorial optimization problems. We establish a “supercritical” trade-off between width and rank, that is we give an example in which small width proofs are possible but require exponentially many rounds to perform them.

Suggested Citation

  • Alexander Razborov, 2017. "On the Width of Semialgebraic Proofs and Algorithms," Mathematics of Operations Research, INFORMS, vol. 42(4), pages 1106-1134, November.
    • Handle: RePEc:inm:ormoor:v:42:y:2017:i:4:p:1106-1134
    DOI: 10.1287/moor.2016.0840
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/moor.2016.0840
    Download Restriction: no
    File URL: https://libkey.io/10.1287/moor.2016.0840?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Michel X. Goemans & Levent Tunçel, 2001. "When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures?," Mathematics of Operations Research, INFORMS, vol. 26(4), pages 796-815, November.
    2. Sanjeeb Dash, 2005. "Exponential Lower Bounds on the Lengths of Some Classes of Branch-and-Cut Proofs," Mathematics of Operations Research, INFORMS, vol. 30(3), pages 678-700, August.
    3. Schrijver, A, 1980. "On Cutting Planes," University of Amsterdam, Actuarial Science and Econometrics Archive 293054, University of Amsterdam, Faculty of Economics and Business.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Sanjeeb Dash, 2005. "Exponential Lower Bounds on the Lengths of Some Classes of Branch-and-Cut Proofs," Mathematics of Operations Research, INFORMS, vol. 30(3), pages 678-700, August.
    2. Adam Kurpisz & Samuli Leppänen & Monaldo Mastrolilli, 2018. "Sum-of-squares rank upper bounds for matching problems," Journal of Combinatorial Optimization, Springer, vol. 36(3), pages 831-844, October.
    3. Monique Laurent, 2003. "Lower Bound for the Number of Iterations in Semidefinite Hierarchies for the Cut Polytope," Mathematics of Operations Research, INFORMS, vol. 28(4), pages 871-883, November.
    4. Thomas Rothvoß & Laura Sanità, 2017. "0/1 Polytopes with Quadratic Chvátal Rank," Operations Research, INFORMS, vol. 65(1), pages 212-220, February.
    5. Daniel Dadush & Santanu S. Dey & Juan Pablo Vielma, 2011. "The Chvátal-Gomory Closure of a Strictly Convex Body," Mathematics of Operations Research, INFORMS, vol. 36(2), pages 227-239, May.
    6. Aardal, K. & van Hoesel, C.P.M., 1995. "Polyhedral techniques in combinatorial optimization," Research Memorandum 014, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    7. Pratik Worah, 2015. "Rank bounds for a hierarchy of Lovász and Schrijver," Journal of Combinatorial Optimization, Springer, vol. 30(3), pages 689-709, October.
    8. Aardal, K.I. & van Hoesel, S., 1995. "Polyhedral Techniques in Combinatorial Optimization," Other publications TiSEM ed028a07-eb6a-4c8d-8f21-d, Tilburg University, School of Economics and Management.
    9. Kevin K. H. Cheung, 2007. "Computation of the Lasserre Ranks of Some Polytopes," Mathematics of Operations Research, INFORMS, vol. 32(1), pages 88-94, February.
    10. Alexander Bockmayr & Friedrich Eisenbrand, 2001. "Cutting Planes and the Elementary Closure in Fixed Dimension," Mathematics of Operations Research, INFORMS, vol. 26(2), pages 304-312, May.
    11. Thomas Rothvoß & Laura Sanità, 2017. "0/1 Polytopes with Quadratic Chvátal Rank," Operations Research, INFORMS, vol. 65(1), pages 212-220, February.
    12. William Cook & Sanjeeb Dash, 2001. "On the Matrix-Cut Rank of Polyhedra," Mathematics of Operations Research, INFORMS, vol. 26(1), pages 19-30, February.
    13. Monique Laurent, 2003. "A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0--1 Programming," Mathematics of Operations Research, INFORMS, vol. 28(3), pages 470-496, August.
    14. Alberto Del Pia & Robert Weismantel, 2016. "Relaxations of mixed integer sets from lattice-free polyhedra," Annals of Operations Research, Springer, vol. 240(1), pages 95-117, May.
    15. Aardal, K.I. & van Hoesel, S., 1995. "Polyhedral Techniques in Combinatorial Optimization," Discussion Paper 1995-57, Tilburg University, Center for Economic Research.
    16. Juliane Dunkel & Andreas S. Schulz, 2013. "The Gomory-Chvátal Closure of a Nonrational Polytope Is a Rational Polytope," Mathematics of Operations Research, INFORMS, vol. 38(1), pages 63-91, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormoor:v:42:y:2017:i:4:p:1106-1134. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.