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

Dynamic knapsack sets and capacitated lot-sizing

Author

Listed:
  • LOPARIC, Marko
  • MARCHAND, Hugues
  • WOLSEY, Laurence A.

Abstract

No abstract is available for this item.

Suggested Citation

  • LOPARIC, Marko & MARCHAND, Hugues & WOLSEY, Laurence A., 2003. "Dynamic knapsack sets and capacitated lot-sizing," LIDAM Reprints CORE 1600, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    • Handle: RePEc:cor:louvrp:1600
    DOI: 10.1007/s10107-002-0341-y
    Note: In : Mathematical Programming, Serie B, 95, 53-69, 2003
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

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


    Cited by:

    1. Brahimi, Nadjib & Absi, Nabil & Dauzère-Pérès, Stéphane & Nordli, Atle, 2017. "Single-item dynamic lot-sizing problems: An updated survey," European Journal of Operational Research, Elsevier, vol. 263(3), pages 838-863.
    2. 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.
    3. Dimitri J. Papageorgiou & Ahmet B. Keha & George L. Nemhauser & Joel Sokol, 2014. "Two-Stage Decomposition Algorithms for Single Product Maritime Inventory Routing," INFORMS Journal on Computing, INFORMS, vol. 26(4), pages 825-847, November.
    4. Cheng-Lung Chen & Eduardo L. Pasiliao & Vladimir Boginski, 2023. "A polyhedral approach to least cost influence maximization in social networks," Journal of Combinatorial Optimization, Springer, vol. 45(1), pages 1-31, January.
    5. Berk, Emre & Toy, Ayhan Ozgur & Hazir, Oncu, 2008. "Single item lot-sizing problem for a warm/cold process with immediate lost sales," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1251-1267, June.
    6. Yongpei Guan & Shabbir Ahmed & George L. Nemhauser, 2009. "Cutting Planes for Multistage Stochastic Integer Programs," Operations Research, INFORMS, vol. 57(2), pages 287-298, April.
    7. Mathieu Van Vyve, 2005. "The Continuous Mixing Polyhedron," Mathematics of Operations Research, INFORMS, vol. 30(2), pages 441-452, May.
    8. Jans, Raf & Degraeve, Zeger, 2007. "Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1855-1875, March.

    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:1600. 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.