IDEAS home Printed from https://ideas.repec.org/p/cor/louvco/2005092.html
   My bibliography  Save this paper

The mixing set with flows

Author

Listed:
  • CONFORTI, Michele
  • DI SUMMA, Marco
  • WOLSEY, Laurence

Abstract

We consider here the mixing set with flows: s + xt >= bt, xt

Suggested Citation

  • CONFORTI, Michele & DI SUMMA, Marco & WOLSEY, Laurence, 2005. "The mixing set with flows," LIDAM Discussion Papers CORE 2005092, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    • Handle: RePEc:cor:louvco:2005092
    as

    Download full text from publisher

    File URL: https://sites.uclouvain.be/core/publications/coredp/coredp2005.html
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. GÜNLÜK, Oktay & POCHET, Yves, 2001. "Mixing mixed-integer inequalities," LIDAM Reprints CORE 1504, 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. Minjiao Zhang & Simge Küçükyavuz & Saumya Goel, 2014. "A Branch-and-Cut Method for Dynamic Decision Making Under Joint Chance Constraints," Management Science, INFORMS, vol. 60(5), pages 1317-1333, May.
    2. Ming Zhao & Minjiao Zhang, 2020. "Multiechelon Lot Sizing: New Complexities and Inequalities," Operations Research, INFORMS, vol. 68(2), pages 534-551, March.
    3. Álvaro Porras & Concepción Domínguez & Juan Miguel Morales & Salvador Pineda, 2023. "Tight and Compact Sample Average Approximation for Joint Chance-Constrained Problems with Applications to Optimal Power Flow," INFORMS Journal on Computing, INFORMS, vol. 35(6), pages 1454-1469, November.
    4. Bansal, Manish & Mehrotra, Sanjay, 2019. "On solving two-stage distributionally robust disjunctive programs with a general ambiguity set," European Journal of Operational Research, Elsevier, vol. 279(2), pages 296-307.
    5. Michele Conforti & Gérard Cornuéjols & Giacomo Zambelli, 2013. "Extended formulations in combinatorial optimization," Annals of Operations Research, Springer, vol. 204(1), pages 97-143, April.
    6. Yan Deng & Siqian Shen & Brian Denton, 2019. "Chance-Constrained Surgery Planning Under Conditions of Limited and Ambiguous Data," INFORMS Journal on Computing, INFORMS, vol. 31(3), pages 559-575, July.
    7. DI SUMMA, Marco & WOLSEY, Laurence, 2010. "Mixing sets linked by bidirected paths," LIDAM Discussion Papers CORE 2010063, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    8. Laurence A. Wolsey, 2002. "Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation," Management Science, INFORMS, vol. 48(12), pages 1587-1602, December.
    9. 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.
    10. Morten Riis & Kim Allan Andersen, 2002. "Capacitated Network Design with Uncertain Demand," INFORMS Journal on Computing, INFORMS, vol. 14(3), pages 247-260, August.
    11. WOLSEY, Laurence A., 2005. "Lot-sizing with production and delivery time windows," LIDAM Discussion Papers CORE 2005043, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    12. Mustafa Kılınç & Jeff Linderoth & James Luedtke & Andrew Miller, 2014. "Strong-branching inequalities for convex mixed integer nonlinear programs," Computational Optimization and Applications, Springer, vol. 59(3), pages 639-665, December.
    13. Shanshan Wang & Jinlin Li & Sanjay Mehrotra, 2021. "Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1661-1677, October.
    14. Gérard Cornuéjols & Yanjun Li & Dieter Vandenbussche, 2003. "K-Cuts: A Variation of Gomory Mixed Integer Cuts from the LP Tableau," INFORMS Journal on Computing, INFORMS, vol. 15(4), pages 385-396, November.
    15. Elçi, Özgün & Noyan, Nilay, 2018. "A chance-constrained two-stage stochastic programming model for humanitarian relief network design," Transportation Research Part B: Methodological, Elsevier, vol. 108(C), pages 55-83.
    16. Reich, Daniel, 2013. "A linear programming approach for linear programs with probabilistic constraints," European Journal of Operational Research, Elsevier, vol. 230(3), pages 487-494.
    17. Michele Conforti & Laurence A. Wolsey & Giacomo Zambelli, 2010. "Projecting an Extended Formulation for Mixed-Integer Covers on Bipartite Graphs," Mathematics of Operations Research, INFORMS, vol. 35(3), pages 603-623, August.
    18. Michele Conforti & Marco Di Summa & Friedrich Eisenbrand & Laurence A. Wolsey, 2009. "Network Formulations of Mixed-Integer Programs," Mathematics of Operations Research, INFORMS, vol. 34(1), pages 194-209, February.
    19. Kai Pan & Yongpei Guan, 2016. "Strong Formulations for Multistage Stochastic Self-Scheduling Unit Commitment," Operations Research, INFORMS, vol. 64(6), pages 1482-1498, December.
    20. CONFORTI, Michele & DI SUMMA, Marco & EISENBRAND, Fritz & WOLSEY, Laurence A., 2006. "Network formulations of mixed-integer programs," LIDAM Discussion Papers CORE 2006117, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).

    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:cor:louvco:2005092. 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: Alain GILLIS (email available below). General contact details of provider: https://edirc.repec.org/data/coreebe.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.