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

Multiperiod allocation of substitutable resources

Author

Listed:
  • Klein, Rachelle S.
  • Luss, Hanan
  • Rothblum, Uriel G.

Abstract

No abstract is available for this item.

Suggested Citation

  • Klein, Rachelle S. & Luss, Hanan & Rothblum, Uriel G., 1995. "Multiperiod allocation of substitutable resources," European Journal of Operational Research, Elsevier, vol. 85(3), pages 488-503, September.
    • Handle: RePEc:eee:ejores:v:85:y:1995:i:3:p:488-503
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(94)00035-B
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Christopher S. Tang, 1988. "A Max-Min Allocation Problem: Its Solutions and Applications," Operations Research, INFORMS, vol. 36(2), pages 359-367, April.
    2. Lisa M. Betts & J. Randall Brown & Hanan Luss, 1994. "Minimax resource allocation problems with ordering constraints," Naval Research Logistics (NRL), John Wiley & Sons, vol. 41(6), pages 719-738, October.
    3. Luss, Hanan, 1992. "Minimax resource allocation problems: Optimization and parametric analysis," European Journal of Operational Research, Elsevier, vol. 60(1), pages 76-86, July.
    4. Pang, Jong-Shi & Chang-Sung, Yu, 1989. "A min-max resource allocation problem with substitutions," European Journal of Operational Research, Elsevier, vol. 41(2), pages 218-223, July.
    5. Hanan Luss & Donald R. Smith, 1988. "Multiperiod allocation of limited resources: A minimax approach," Naval Research Logistics (NRL), John Wiley & Sons, vol. 35(4), pages 493-501, August.
    6. Rachelle S. Klein & Hanan Luss & Uriel G. Rothblum, 1993. "Minimax Resource Allocation Problems with Resource-Substitutions Represented by Graphs," Operations Research, INFORMS, vol. 41(5), pages 959-971, October.
    7. Quynh C. Nguyen & Richard E. Stone, 1993. "A Multiperiod Minimax Resource Allocation Problem with Substitutable Resources," Management Science, INFORMS, vol. 39(8), pages 964-974, August.
    8. J. Randall Brown, 1984. "The Linear Sharing Problem," Operations Research, INFORMS, vol. 32(5), pages 1087-1106, October.
    9. Rachelle S. Klein & Hanan Luss, 1991. "Minimax Resource Allocation with Tree Structured Substitutable Resources," Operations Research, INFORMS, vol. 39(2), pages 285-295, April.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Hanan Luss, 1999. "On Equitable Resource Allocation Problems: A Lexicographic Minimax Approach," Operations Research, INFORMS, vol. 47(3), pages 361-378, June.

    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. Hanan Luss, 1999. "On Equitable Resource Allocation Problems: A Lexicographic Minimax Approach," Operations Research, INFORMS, vol. 47(3), pages 361-378, June.
    2. Fujimoto, Masako & Yamada, Takeo, 2006. "An exact algorithm for the knapsack sharing problem with common items," European Journal of Operational Research, Elsevier, vol. 171(2), pages 693-707, June.
    3. Mhand Hifi & Slim Sadfi & Abdelkader Sbihi, 2004. "An Exact Algorithm for the Multiple-choice Multidimensional Knapsack Problem," Post-Print halshs-03322716, HAL.
    4. Sbihi, Abdelkader, 2010. "A cooperative local search-based algorithm for the Multiple-Scenario Max-Min Knapsack Problem," European Journal of Operational Research, Elsevier, vol. 202(2), pages 339-346, April.
    5. Yamada, Takeo & Futakawa, Mayumi & Kataoka, Seiji, 1998. "Some exact algorithms for the knapsack sharing problem," European Journal of Operational Research, Elsevier, vol. 106(1), pages 177-183, April.
    6. Mhand Hifi & Slim Sadfi & Abdelkader Sbihi, 2004. "An Exact Algorithm for the Multiple-choice Multidimensional Knapsack Problem," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-03322716, HAL.
    7. Hanan Luss, 2008. "An Equitable Bandwidth Allocation Model for Video-on-Demand Networks," Networks and Spatial Economics, Springer, vol. 8(1), pages 23-41, March.
    8. Lisa M. Betts & J. Randall Brown & Hanan Luss, 1994. "Minimax resource allocation problems with ordering constraints," Naval Research Logistics (NRL), John Wiley & Sons, vol. 41(6), pages 719-738, October.
    9. Mhand Hifi & Slim Sadfi, 2002. "The Knapsack Sharing Problem: An Exact Algorithm," Journal of Combinatorial Optimization, Springer, vol. 6(1), pages 35-54, March.
    10. G. Yu, 1998. "Min-Max Optimization of Several Classical Discrete Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 98(1), pages 221-242, July.
    11. Abdelkader Sbihi, 2007. "A best first search exact algorithm for the Multiple-choice Multidimensional Knapsack Problem," Journal of Combinatorial Optimization, Springer, vol. 13(4), pages 337-351, May.
    12. B. Golany & N. Goldberg & U. Rothblum, 2015. "Allocating multiple defensive resources in a zero-sum game setting," Annals of Operations Research, Springer, vol. 225(1), pages 91-109, February.
    13. Jinfa Chen & David D. Yao & Shaohui Zheng, 2001. "Optimal Replenishment and Rework with Multiple Unreliable Supply Sources," Operations Research, INFORMS, vol. 49(3), pages 430-443, June.
    14. Selcuk Karabati & Panagiotis Kouvelis & Gang Yu, 2001. "A Min-Max-Sum Resource Allocation Problem and Its Applications," Operations Research, INFORMS, vol. 49(6), pages 913-922, December.
    15. Yuceer, Umit, 1997. "A multi-product loading problem: a model and solution method," European Journal of Operational Research, Elsevier, vol. 101(3), pages 519-531, September.
    16. Stephen A. Smith & Narendra Agrawal, 2000. "Management of Multi-Item Retail Inventory Systems with Demand Substitution," Operations Research, INFORMS, vol. 48(1), pages 50-64, February.
    17. Muralidharan S. Kodialam & Hanan Luss, 1998. "Algorithms for Separable Nonlinear Resource Allocation Problems," Operations Research, INFORMS, vol. 46(2), pages 272-284, April.
    18. Patriksson, Michael, 2008. "A survey on the continuous nonlinear resource allocation problem," European Journal of Operational Research, Elsevier, vol. 185(1), pages 1-46, February.
    19. Renato de Matta & Vernon Ning Hsu & Timothy J. Lowe, 1999. "The selection allocation problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(6), pages 707-725, September.
    20. Kasin Ransikarbum & Scott J. Mason, 2016. "Multiple-objective analysis of integrated relief supply and network restoration in humanitarian logistics operations," International Journal of Production Research, Taylor & Francis Journals, vol. 54(1), pages 49-68, January.

    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:eee:ejores:v:85:y:1995:i:3:p:488-503. 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.