IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v240y2016i1d10.1007_s10479-015-2024-0.html
   My bibliography  Save this article

Relaxations of mixed integer sets from lattice-free polyhedra

Author

Listed:
  • Alberto Del Pia

    (University of Wisconsin-Madison)

  • Robert Weismantel

    (ETH Zürich)

Abstract

This paper gives an introduction to a recently established link between the geometry of numbers and mixed integer optimization. The main focus is to provide a review of families of lattice-free polyhedra and their use in a disjunctive programming approach. The use of lattice-free polyhedra in the context of deriving and explaining cutting planes for mixed integer programs is not only mathematically interesting, but it leads to some fundamental new discoveries, such as an understanding under which conditions cutting planes algorithms converge finitely.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:annopr:v:240:y:2016:i:1:d:10.1007_s10479-015-2024-0
    DOI: 10.1007/s10479-015-2024-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-015-2024-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-015-2024-0?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Benjamin Nill & Günter M. Ziegler, 2011. "Projecting Lattice Polytopes Without Interior Lattice Points," Mathematics of Operations Research, INFORMS, vol. 36(3), pages 462-467, August.
    2. SALINETTI, Gabriella & WETS, Roger J.-B., 1979. "On the convergence of sequences of convex sets in finite dimensions," LIDAM Reprints CORE 352, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. Amitabh Basu & Gérard Cornuéjols & François Margot, 2012. "Intersection Cuts with Infinite Split Rank," Mathematics of Operations Research, INFORMS, vol. 37(1), pages 21-40, February.
    4. MARCHAND, Hugues & WOLSEY, Laurence A., 2001. "Aggregation and mixed integer rounding to solve mips," LIDAM Reprints CORE 1513, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    5. Amitabh Basu & Gérard Cornuéjols & Matthias Köppe, 2012. "Unique Minimal Liftings for Simplicial Polytopes," Mathematics of Operations Research, INFORMS, vol. 37(2), pages 346-355, May.
    6. Schrijver, A, 1980. "On Cutting Planes," University of Amsterdam, Actuarial Science and Econometrics Archive 293054, University of Amsterdam, Faculty of Economics and Business.
    7. Sanjeeb Dash & Oktay Günlük & Juan Pablo Vielma, 2014. "Computational Experiments with Cross and Crooked Cross Cuts," INFORMS Journal on Computing, INFORMS, vol. 26(4), pages 780-797, November.
    8. Egon Balas, 1971. "Intersection Cuts—A New Type of Cutting Planes for Integer Programming," Operations Research, INFORMS, vol. 19(1), pages 19-39, February.
    9. Gennadiy Averkov & Christian Wagner & Robert Weismantel, 2011. "Maximal Lattice-Free Polyhedra: Finiteness and an Explicit Description in Dimension Three," Mathematics of Operations Research, INFORMS, vol. 36(4), pages 721-742, November.
    10. DEY, Santanu S. & WOLSEY, Laurence A., 2010. "Two row mixed-integer cuts via lifting," LIDAM Reprints CORE 2254, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    11. Hugues Marchand & Laurence A. Wolsey, 2001. "Aggregation and Mixed Integer Rounding to Solve MIPs," Operations Research, INFORMS, vol. 49(3), pages 363-371, June.
    12. Michele Conforti & Gérard Cornuéjols & Giacomo Zambelli, 2011. "A Geometric Perspective on Lifting," Operations Research, INFORMS, vol. 59(3), pages 569-577, June.
    13. Amitabh Basu & Michele Conforti & Gérard Cornuéjols & Giacomo Zambelli, 2010. "Maximal Lattice-Free Convex Sets in Linear Subspaces," Mathematics of Operations Research, INFORMS, vol. 35(3), pages 704-720, August.
    14. NEMHAUSER, George L. & WOLSEY, Laurence A., 1990. "A recursive procedure to generate all cuts for 0-1 mixed integer programs," LIDAM Reprints CORE 894, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    15. Santanu S. Dey & Quentin Louveaux, 2011. "Split Rank of Triangle and Quadrilateral Inequalities," Mathematics of Operations Research, INFORMS, vol. 36(3), pages 432-461, August.
    16. Alberto Del Pia, 2012. "On the Rank of Disjunctive Cuts," Mathematics of Operations Research, INFORMS, vol. 37(2), pages 372-378, May.
    17. Kent Andersen & Quentin Louveaux & Robert Weismantel, 2010. "An Analysis of Mixed Integer Linear Sets Based on Lattice Point Free Convex Sets," Mathematics of Operations Research, INFORMS, vol. 35(1), pages 233-256, February.
    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. Amitabh Basu & Pierre Bonami & Gérard Cornuéjols & François Margot, 2011. "Experiments with Two-Row Cuts from Degenerate Tableaux," INFORMS Journal on Computing, INFORMS, vol. 23(4), pages 578-590, November.
    2. Santanu S. Dey & Quentin Louveaux, 2011. "Split Rank of Triangle and Quadrilateral Inequalities," Mathematics of Operations Research, INFORMS, vol. 36(3), pages 432-461, August.
    3. 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.
    4. Matteo Fischetti & Domenico Salvagnin, 2013. "Approximating the Split Closure," INFORMS Journal on Computing, INFORMS, vol. 25(4), pages 808-819, November.
    5. Alberto Del Pia, 2012. "On the Rank of Disjunctive Cuts," Mathematics of Operations Research, INFORMS, vol. 37(2), pages 372-378, May.
    6. Amitabh Basu & Gérard Cornuéjols & Matthias Köppe, 2012. "Unique Minimal Liftings for Simplicial Polytopes," Mathematics of Operations Research, INFORMS, vol. 37(2), pages 346-355, May.
    7. Gennadiy Averkov & Christian Wagner & Robert Weismantel, 2011. "Maximal Lattice-Free Polyhedra: Finiteness and an Explicit Description in Dimension Three," Mathematics of Operations Research, INFORMS, vol. 36(4), pages 721-742, November.
    8. Valentin Borozan & Gérard Cornuéjols, 2009. "Minimal Valid Inequalities for Integer Constraints," Mathematics of Operations Research, INFORMS, vol. 34(3), pages 538-546, August.
    9. Andreas Eisenblätter & Hans-Florian Geerdes & Thorsten Koch & Alexander Martin & Roland Wessäly, 2006. "UMTS radio network evaluation and optimization beyond snapshots," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 63(1), pages 1-29, February.
    10. Santanu S. Dey & Andrea Lodi & Andrea Tramontani & Laurence A. Wolsey, 2014. "On the Practical Strength of Two-Row Tableau Cuts," INFORMS Journal on Computing, INFORMS, vol. 26(2), pages 222-237, May.
    11. Alper Atamtürk, 2004. "Sequence Independent Lifting for Mixed-Integer Programming," Operations Research, INFORMS, vol. 52(3), pages 487-490, June.
    12. Alper Atamtürk & Martin Savelsbergh, 2005. "Integer-Programming Software Systems," Annals of Operations Research, Springer, vol. 140(1), pages 67-124, November.
    13. Alper Atamtürk, 2005. "Cover and Pack Inequalities for (Mixed) Integer Programming," Annals of Operations Research, Springer, vol. 139(1), pages 21-38, October.
    14. Gennadiy Averkov & Jan Krümpelmann & Stefan Weltge, 2017. "Notions of Maximality for Integral Lattice-Free Polyhedra: The Case of Dimension Three," Mathematics of Operations Research, INFORMS, vol. 42(4), pages 1035-1062, November.
    15. Chardy, M. & Costa, M.-C. & Faye, A. & Trampont, M., 2012. "Optimizing splitter and fiber location in a multilevel optical FTTH network," European Journal of Operational Research, Elsevier, vol. 222(3), pages 430-440.
    16. Xiaoyi Gu & Santanu S. Dey & Jean-Philippe P. Richard, 2024. "Solving Sparse Separable Bilinear Programs Using Lifted Bilinear Cover Inequalities," INFORMS Journal on Computing, INFORMS, vol. 36(3), pages 884-899, May.
    17. Amitabh Basu & Gérard Cornuéjols & François Margot, 2012. "Intersection Cuts with Infinite Split Rank," Mathematics of Operations Research, INFORMS, vol. 37(1), pages 21-40, February.
    18. Laszlo Ladanyi & Jon Lee & Robin Lougee-Heimer, 2005. "Rapid Prototyping of Optimization Algorithms Using COIN-OR: A Case Study Involving the Cutting-Stock Problem," Annals of Operations Research, Springer, vol. 139(1), pages 243-265, October.
    19. Egon Balas & Gérard Cornuéjols & Tamás Kis & Giacomo Nannicini, 2013. "Combining Lift-and-Project and Reduce-and-Split," INFORMS Journal on Computing, INFORMS, vol. 25(3), pages 475-487, August.
    20. Agostinho Agra & Marielle Christiansen & Alexandrino Delgado, 2013. "Mixed Integer Formulations for a Short Sea Fuel Oil Distribution Problem," Transportation Science, INFORMS, vol. 47(1), pages 108-124, 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:spr:annopr:v:240:y:2016:i:1:d:10.1007_s10479-015-2024-0. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.