IDEAS home Printed from https://ideas.repec.org/p/mit/sloanp/2028.html
   My bibliography  Save this paper

Consecutive optimizors for a partitioning problem with applications to optimal inventory groupings for joint replenishment

Author

Listed:
  • Chakravarty, A. K.
  • Orlin, James B., 1953-.
  • Rothblum, U. G.

Abstract

No abstract is available for this item.

Suggested Citation

  • Chakravarty, A. K. & Orlin, James B., 1953-. & Rothblum, U. G., 1982. "Consecutive optimizors for a partitioning problem with applications to optimal inventory groupings for joint replenishment," Working papers 1383-82., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    • Handle: RePEc:mit:sloanp:2028
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/1721.1/2028
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Eric V. Denardo & Gur Huberman & Uriel G. Rothblum, 1982. "Optimal Locations on a Line Are Interleaved," Operations Research, INFORMS, vol. 30(4), pages 745-759, August.
    2. Chakravarty, Amiya K., 1982. "Inventory grouping for joint replenishment," Engineering Costs and Production Economics, Elsevier, vol. 7(1), pages 19-24, July.
    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. Yaakov Malinovsky, 2019. "Sterrett Procedure for the Generalized Group Testing Problem," Methodology and Computing in Applied Probability, Springer, vol. 21(3), pages 829-840, September.
    2. Huang, Rongbing & Menezes, Mozart B.C. & Kim, Seokjin, 2012. "The impact of cost uncertainty on the location of a distribution center," European Journal of Operational Research, Elsevier, vol. 218(2), pages 401-407.
    3. Konstantaras, Ioannis & Skouri, Konstantina & Benkherouf, Lakdere, 2021. "Optimizing inventory decisions for a closed–loop supply chain model under a carbon tax regulatory mechanism," International Journal of Production Economics, Elsevier, vol. 239(C).
    4. Frank K. Hwang & Uriel G. Rothblum, 2011. "On the number of separable partitions," Journal of Combinatorial Optimization, Springer, vol. 21(4), pages 423-433, May.
    5. Huilan Chang & Frank K. Hwang & Uriel G. Rothblum, 2012. "A new approach to solve open-partition problems," Journal of Combinatorial Optimization, Springer, vol. 23(1), pages 61-78, January.
    6. Lap Mui Ann Chan & David Simchi-Levi, 1998. "Probabilistic Analyses and Algorithms for Three-Level Distribution Systems," Management Science, INFORMS, vol. 44(11-Part-1), pages 1562-1576, November.

    More about this item

    Keywords

    HD28 .M414 no.1383-; 82;

    JEL classification:

    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:mit:sloanp:2028. 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: None (email available below). General contact details of provider: https://edirc.repec.org/data/ssmitus.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.