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

Lifted Euclidean inequalities for the integer single node flow set with upper bounds

Author

Listed:
  • Agra, Agostinho
  • Constantino, Miguel Fragoso

Abstract

In this paper we discuss the polyhedral structure of the integer single node flow set with two possible values for the upper bounds on the arc flows. Such mixed integer sets arise as substructures in complex mixed integer programs for real application problems.

Suggested Citation

  • Agra, Agostinho & Constantino, Miguel Fragoso, 2016. "Lifted Euclidean inequalities for the integer single node flow set with upper bounds," European Journal of Operational Research, Elsevier, vol. 251(1), pages 53-63.
    • Handle: RePEc:eee:ejores:v:251:y:2016:i:1:p:53-63
    DOI: 10.1016/j.ejor.2015.10.057
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221715009832
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2015.10.057?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. Miguel Constantino, 1998. "Lower Bounds in Lot-Sizing Models: A Polyhedral Study," Mathematics of Operations Research, INFORMS, vol. 23(1), pages 101-118, February.
    2. LOUVEAUX, Quentin & WOLSEY, Laurence A., 2003. "Lifting, superadditivity, mixed integer rounding and single node flow sets revisited," LIDAM Reprints CORE 1659, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. M. W. Padberg & T. J. Van Roy & L. A. Wolsey, 1985. "Valid Linear Inequalities for Fixed Charge Problems," Operations Research, INFORMS, vol. 33(4), pages 842-861, August.
    4. LOUVEAUX, Quentin & WOLSEY, Laurence, 2003. "Lifting, superadditivity, mixed integer rounding and single node flow sets revisited," LIDAM Discussion Papers CORE 2003001, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    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. Quentin Louveaux & Laurence Wolsey, 2007. "Lifting, superadditivity, mixed integer rounding and single node flow sets revisited," Annals of Operations Research, Springer, vol. 153(1), pages 47-77, September.
    2. Akbalik, A. & Pochet, Y., 2009. "Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs," European Journal of Operational Research, Elsevier, vol. 198(2), pages 412-434, October.
    3. Yves Crama & Michel Grabisch & Silvano Martello, 2022. "Sixty-one surveys in operations research," Annals of Operations Research, Springer, vol. 314(1), pages 5-13, July.
    4. Denis Bouyssou & Silvano Martello & Frank Plastria, 2010. "Eleven surveys in operations research: II," Annals of Operations Research, Springer, vol. 175(1), pages 3-8, March.
    5. Leo Liberti & Thierry Marchant & Silvano Martello, 2013. "Eleven surveys in operations research: III," Annals of Operations Research, Springer, vol. 204(1), pages 3-9, April.
    6. Alper Atamtürk & Simge Küçükyavuz, 2005. "Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation," Operations Research, INFORMS, vol. 53(4), pages 711-730, August.
    7. Yves Crama & Michel Grabisch & Silvano Martello, 2018. "Surveys in operations research," Annals of Operations Research, Springer, vol. 271(1), pages 3-10, December.
    8. Leo Liberti & Thierry Marchant & Silvano Martello, 2016. "Twelve surveys in operations research," Annals of Operations Research, Springer, vol. 240(1), pages 3-11, May.
    9. Alper Atamtürk, 2005. "Cover and Pack Inequalities for (Mixed) Integer Programming," Annals of Operations Research, Springer, vol. 139(1), pages 21-38, October.
    10. Avella, P. & Boccia, M. & Mattia, S. & Rossi, F., 2021. "Weak flow cover inequalities for the capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 289(2), pages 485-494.
    11. Absi, Nabil & Kedad-Sidhoum, Safia, 2008. "The multi-item capacitated lot-sizing problem with setup times and shortage costs," European Journal of Operational Research, Elsevier, vol. 185(3), pages 1351-1374, March.
    12. Lisa A. Miller & Yanjun Li & Jean‐Philippe P. Richard, 2008. "New inequalities for finite and infinite group problems from approximate lifting," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(2), pages 172-191, March.
    13. Binyuan Chen & Simge Küçükyavuz & Suvrajeet Sen, 2011. "Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs," Operations Research, INFORMS, vol. 59(1), pages 202-210, February.
    14. Wei-Kun Chen & Liang Chen & Mu-Ming Yang & Yu-Hong Dai, 2018. "Generalized coefficient strengthening cuts for mixed integer programming," Journal of Global Optimization, Springer, vol. 70(1), pages 289-306, January.
    15. Fred Glover & Hanif Sherali, 2005. "Some Classes of Valid Inequalities and Convex Hull Characterizations for Dynamic Fixed-Charge Problems under Nested Constraints," Annals of Operations Research, Springer, vol. 140(1), pages 215-233, November.
    16. Yves Pochet & Mathieu Van Vyve, 2004. "A General Heuristic for Production Planning Problems," INFORMS Journal on Computing, INFORMS, vol. 16(3), pages 316-327, August.
    17. 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.
    18. Doostmohammadi, Mahdi & Akartunalı, Kerem, 2018. "Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: Zero setup case," European Journal of Operational Research, Elsevier, vol. 267(1), pages 86-95.
    19. Anulark Pinnoi & Wilbert E. Wilhelm, 1998. "Assembly System Design: A Branch and Cut Approach," Management Science, INFORMS, vol. 44(1), pages 103-118, January.
    20. Manfred Padberg, 2005. "Classical Cuts for Mixed-Integer Programming and Branch-and-Cut," Annals of Operations Research, Springer, vol. 139(1), pages 321-352, October.

    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:251:y:2016:i:1:p:53-63. 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.