IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v226y2013i2p203-210.html
   My bibliography  Save this article

Master corner polyhedron: Vertices

Author

Listed:
  • Shlyk, Vladimir A.

Abstract

We focus on the vertices of the master corner polyhedron (MCP), a fundamental object in the theory of integer linear programming. We introduce two combinatorial operations that transform vertices to their neighbors. This implies that each MCP can be defined by the initial vertices regarding these operations; we call them support vertices. We prove that the class of support vertices of all MCPs over a group is invariant under automorphisms of this group and describe MCP vertex bases. Among other results, we characterize its irreducible points, establish relations between a vertex and the nontrivial facets that pass through it, and prove that this polyhedron is of diameter 2.

Suggested Citation

  • Shlyk, Vladimir A., 2013. "Master corner polyhedron: Vertices," European Journal of Operational Research, Elsevier, vol. 226(2), pages 203-210.
    • Handle: RePEc:eee:ejores:v:226:y:2013:i:2:p:203-210
    DOI: 10.1016/j.ejor.2012.11.011
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221712008351
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2012.11.011?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. 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.
    2. DEY, Santanu S. & WOLSEY, Laurence A., 2010. "Constrained infinite group relaxations of MIPS," LIDAM Reprints CORE 2314, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. Kianfar, Kiavash & Fathi, Yahya, 2010. "Generating facets for finite master cyclic group polyhedra using n-step mixed integer rounding functions," European Journal of Operational Research, Elsevier, vol. 207(1), pages 105-109, November.
    4. Klabjan, Diego, 2007. "Subadditive approaches in integer programming," European Journal of Operational Research, Elsevier, vol. 183(2), pages 525-545, December.
    5. Balas, Egon, 2002. "Some thoughts on the development of integer programming during my research career - lecture delivered upon receiving the EURO Gold Medal, July 9, 2001, Rotterdam," European Journal of Operational Research, Elsevier, vol. 141(1), pages 1-7, August.
    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. Michele Conforti & Gérard Cornuéjols & Giacomo Zambelli, 2011. "A Geometric Perspective on Lifting," Operations Research, INFORMS, vol. 59(3), pages 569-577, June.
    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. 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.
    4. Michele Conforti & Gérard Cornuéjols & Aris Daniilidis & Claude Lemaréchal & Jérôme Malick, 2015. "Cut-Generating Functions and S -Free Sets," Mathematics of Operations Research, INFORMS, vol. 40(2), pages 276-391, February.
    5. Sercan Yıldız & Gérard Cornuéjols, 2016. "Cut-Generating Functions for Integer Variables," Mathematics of Operations Research, INFORMS, vol. 41(4), pages 1381-1403, November.
    6. Amitabh Basu & Robert Hildebrand & Matthias Köppe, 2015. "Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. I. The One-Dimensional Case," Mathematics of Operations Research, INFORMS, vol. 40(1), pages 105-129, February.
    7. 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.
    8. 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.
    9. 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.
    10. Monabbati, Ehsan & Kakhki, Hossein Taghizadeh, 2015. "On a class of subadditive duals for the uncapacitated facility location problem," Applied Mathematics and Computation, Elsevier, vol. 251(C), pages 118-131.
    11. Kianfar, Kiavash & Fathi, Yahya, 2010. "Generating facets for finite master cyclic group polyhedra using n-step mixed integer rounding functions," European Journal of Operational Research, Elsevier, vol. 207(1), pages 105-109, November.
    12. 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.
    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. Fatma Kılınç-Karzan, 2016. "On Minimal Valid Inequalities for Mixed Integer Conic Programs," Mathematics of Operations Research, INFORMS, vol. 41(2), pages 477-510, May.
    15. Egon Balas & Thiago Serra, 2020. "When Lift-and-Project Cuts Are Different," INFORMS Journal on Computing, INFORMS, vol. 32(3), pages 822-834, July.
    16. Amitabh Basu & Robert Hildebrand & Matthias Köppe, 2016. "Light on the infinite group relaxation I: foundations and taxonomy," 4OR, Springer, vol. 14(1), pages 1-40, March.
    17. Amitabh Basu & Robert Hildebrand & Matthias Köppe, 2016. "Light on the infinite group relaxation II: sufficient conditions for extremality, sequences, and algorithms," 4OR, Springer, vol. 14(2), pages 107-131, June.
    18. Andrew C. Trapp & Oleg A. Prokopyev & Andrew J. Schaefer, 2013. "On a Level-Set Characterization of the Value Function of an Integer Program and Its Application to Stochastic Programming," Operations Research, INFORMS, vol. 61(2), pages 498-511, April.

    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:eee:ejores:v:226:y:2013:i:2:p:203-210. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.