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

Approximate extended formulations

Author

Listed:
  • VAN VYVE, Matthieu
  • WOLSEY, Laurence A.

Abstract

No abstract is available for this item.

Suggested Citation

  • VAN VYVE, Matthieu & WOLSEY, Laurence A., 2006. "Approximate extended formulations," LIDAM Reprints CORE 1807, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    • Handle: RePEc:cor:louvrp:1807
    DOI: 10.1007/s10107-005-0663-7
    Note: In : Mathematical Programming, series B, 105, 501-522, 2006.
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1007/s10107-005-0663-7
    Download Restriction: no
    File URL: https://libkey.io/10.1007/s10107-005-0663-7?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
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Mathijn Retel Helmrich & Raf Jans & Wilco van den Heuvel & Albert Wagelmans, 2014. "Economic lot-sizing with remanufacturing: complexity and efficient formulations," IISE Transactions, Taylor & Francis Journals, vol. 46(1), pages 67-86.
    2. Fiorotto, Diego Jacinto & Jans, Raf & Alexandre de Araujo, Silvio, 2018. "Process flexibility and the chaining principle in lot sizing problems," International Journal of Production Economics, Elsevier, vol. 204(C), pages 244-263.
    3. Cunha, Jesus O. & Melo, Rafael A., 2021. "Valid inequalities, preprocessing, and an effective heuristic for the uncapacitated three-level lot-sizing and replenishment problem with a distribution structure," European Journal of Operational Research, Elsevier, vol. 295(3), pages 874-892.
    4. Ioannis Fragkos & Zeger Degraeve & Bert De Reyck, 2016. "A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times," INFORMS Journal on Computing, INFORMS, vol. 28(3), pages 465-482, August.
    5. Agostinho Agra & Marielle Christiansen & Kristine S. Ivarsøy & Ida Elise Solhaug & Asgeir Tomasgard, 2017. "Combined ship routing and inventory management in the salmon farming industry," Annals of Operations Research, Springer, vol. 253(2), pages 799-823, June.
    6. Gábor Braun & Samuel Fiorini & Sebastian Pokutta & David Steurer, 2015. "Approximation Limits of Linear Programs (Beyond Hierarchies)," Mathematics of Operations Research, INFORMS, vol. 40(3), pages 756-772, March.
    7. VAN VYVE, Mathieu & WOLSEY, Laurence & YAMAN, Hande, 2012. "Relaxations for two-level multi-item lot-sizing problem," LIDAM Discussion Papers CORE 2012031, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    8. Kerem Akartunalı & Ioannis Fragkos & Andrew J. Miller & Tao Wu, 2016. "Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 766-780, November.
    9. Silvio Alexandre de Araujo & Bert De Reyck & Zeger Degraeve & Ioannis Fragkos & Raf Jans, 2015. "Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times," INFORMS Journal on Computing, INFORMS, vol. 27(3), pages 431-448, August.
    10. Attila, Öykü Naz & Agra, Agostinho & Akartunalı, Kerem & Arulselvan, Ashwin, 2021. "Robust formulations for economic lot-sizing problem with remanufacturing," European Journal of Operational Research, Elsevier, vol. 288(2), pages 496-510.
    11. Daniel Porumbel & François Clautiaux, 2017. "Constraint Aggregation in Column Generation Models for Resource-Constrained Covering Problems," INFORMS Journal on Computing, INFORMS, vol. 29(1), pages 170-184, February.
    12. Christopher Hojny & Tristan Gally & Oliver Habeck & Hendrik Lüthen & Frederic Matter & Marc E. Pfetsch & Andreas Schmitt, 2020. "Knapsack polytopes: a survey," Annals of Operations Research, Springer, vol. 292(1), pages 469-517, September.
    13. Chen, Haoxun, 2015. "Fix-and-optimize and variable neighborhood search approaches for multi-level capacitated lot sizing problems," Omega, Elsevier, vol. 56(C), pages 25-36.
    14. 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.

    More about this item

    Statistics

    Access and download statistics

    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:louvrp:1807. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.