IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v31y2016i3d10.1007_s10878-014-9810-5.html
   My bibliography  Save this article

Cardinality constraints and systems of restricted representatives

Author

Listed:
  • Ioannis Mourtos

    (Athens University of Economics and Business)

Abstract

Cardinality constraints have received considerable attention from the Constraint Programming community as (so-called) global constraints that appear in the formulation of several real-life problems, while also having an interesting combinatorial structure. After discussing the relation of cardinality constraints with well-known combinatorial problems (e.g., systems of restricted representatives), we study the polytope defined by the convex hull of vectors satisfying two such constraints, in the case where all variables share a common domain. We provide families of facet-defining inequalities that are polytime separable, together with a condition for when these families of inequalities define a convex hull relaxation. Our results also hold for the case of a single such constraint.

Suggested Citation

  • Ioannis Mourtos, 2016. "Cardinality constraints and systems of restricted representatives," Journal of Combinatorial Optimization, Springer, vol. 31(3), pages 1061-1089, April.
    • Handle: RePEc:spr:jcomop:v:31:y:2016:i:3:d:10.1007_s10878-014-9810-5
    DOI: 10.1007/s10878-014-9810-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-014-9810-5
    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/s10878-014-9810-5?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. Michela Milano & Greger Ottosson & Philippe Refalo & Erlendur S. Thorsteinsson, 2002. "The Role of Integer Programming Techniques in Constraint Programming's Global Constraints," INFORMS Journal on Computing, INFORMS, vol. 14(4), pages 387-402, November.
    2. BALAS, Egon & BOCKMAYR, Alexander & PISARUK, Nicolai & WOLSEY, Laurence, 2002. "On unions and dominants of polytopes," LIDAM Discussion Papers CORE 2002008, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. John N. Hooker, 2012. "Integrated Methods for Optimization," International Series in Operations Research and Management Science, Springer, number 978-1-4614-1900-6, December.
    4. H.P. Williams & Hong Yan, 2001. "Representations of the all_different Predicate of Constraint Satisfaction in Integer Programming," INFORMS Journal on Computing, INFORMS, vol. 13(2), pages 96-103, May.
    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. Dan A. Iancu & Marek Petrik & Dharmashankar Subramanian, 2015. "Tight Approximations of Dynamic Risk Measures," Mathematics of Operations Research, INFORMS, vol. 40(3), pages 655-682, March.
    2. Maryam Daryalal & Hamed Pouya & Marc Antoine DeSantis, 2023. "Network Migration Problem: A Hybrid Logic-Based Benders Decomposition Approach," INFORMS Journal on Computing, INFORMS, vol. 35(3), pages 593-613, May.
    3. Edmund Burke & Jakub Mareček & Andrew Parkes & Hana Rudová, 2010. "A supernodal formulation of vertex colouring with applications in course timetabling," Annals of Operations Research, Springer, vol. 179(1), pages 105-130, September.
    4. L. Foulds & B. Toklu & J. Wilson, 2009. "Modelling either-or relations in integer programming," Annals of Operations Research, Springer, vol. 166(1), pages 203-222, February.
    5. Aliza Heching & J. N. Hooker & Ryo Kimura, 2019. "A Logic-Based Benders Approach to Home Healthcare Delivery," Transportation Science, INFORMS, vol. 53(2), pages 510-522, March.
    6. Morton, Alec & Thomas, Ranjeeta & Smith, Peter C., 2016. "Decision rules for allocation of finances to health systems strengthening," Journal of Health Economics, Elsevier, vol. 49(C), pages 97-108.
    7. Gerdus Benadè & John N. Hooker, 2020. "Optimization Bounds from the Branching Dual," INFORMS Journal on Computing, INFORMS, vol. 32(1), pages 3-15, January.
    8. Branislav Micieta & Jolanta Staszewska & Matej Kovalsky & Martin Krajcovic & Vladimira Binasova & Ladislav Papanek & Ivan Antoniuk, 2021. "Innovative System for Scheduling Production Using a Combination of Parametric Simulation Models," Sustainability, MDPI, vol. 13(17), pages 1-20, August.
    9. Qin, Tianbao & Du, Yuquan & Sha, Mei, 2016. "Evaluating the solution performance of IP and CP for berth allocation with time-varying water depth," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 87(C), pages 167-185.
    10. Andre A. Cire & John N. Hooker & Tallys Yunes, 2016. "Modeling with Metaconstraints and Semantic Typing of Variables," INFORMS Journal on Computing, INFORMS, vol. 28(1), pages 1-13, 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:jcomop:v:31:y:2016:i:3:d:10.1007_s10878-014-9810-5. 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.