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

Some exact algorithms for the knapsack sharing problem

Author

Listed:
  • Yamada, Takeo
  • Futakawa, Mayumi
  • Kataoka, Seiji

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:106:y:1998:i:1:p:177-183
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(97)00165-3
    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. J. Randall Brown, 1979. "The Sharing Problem," Operations Research, INFORMS, vol. 27(2), pages 324-340, April.
    2. Christopher S. Tang, 1988. "A Max-Min Allocation Problem: Its Solutions and Applications," Operations Research, INFORMS, vol. 36(2), pages 359-367, April.
    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. J. Randall Brown, 1979. "The Knapsack Sharing Problem," Operations Research, INFORMS, vol. 27(2), pages 341-355, April.
    5. Stephen Jacobsen, 1971. "On Marginal Allocation in Single Constraint Min-Max Problems," Management Science, INFORMS, vol. 17(11), pages 780-783, July.
    6. Seymour Kaplan, 1974. "Application of Programs with Maximin Objective Functions to Problems of Optimal Resource Allocation," Operations Research, INFORMS, vol. 22(4), pages 802-807, August.
    7. Evan L. Porteus & Jonathan S. Yormark, 1972. "More on Min-Max Allocation," Management Science, INFORMS, vol. 18(9), pages 502-507, May.
    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. 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.
    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. Thekra Al-douri & Mhand Hifi & Vassilis Zissimopoulos, 2021. "An iterative algorithm for the Max-Min knapsack problem with multiple scenarios," Operational Research, Springer, vol. 21(2), pages 1355-1392, June.
    4. Dahmani, Isma & Hifi, Mhand & Wu, Lei, 2016. "An exact decomposition algorithm for the generalized knapsack sharing problem," European Journal of Operational Research, Elsevier, vol. 252(3), pages 761-774.

    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, 2002. "The Knapsack Sharing Problem: An Exact Algorithm," Journal of Combinatorial Optimization, Springer, vol. 6(1), pages 35-54, March.
    4. Pursals, Salvador Casadesús & Garzón, Federico Garriga, 2009. "Optimal building evacuation time considering evacuation routes," European Journal of Operational Research, Elsevier, vol. 192(2), pages 692-699, January.
    5. 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.
    6. 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.
    7. Richard Francis & Timothy Lowe, 2014. "Comparative error bound theory for three location models: continuous demand versus discrete demand," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 22(1), pages 144-169, April.
    8. Florian Biermann & Victor Naroditskiy & Maria Polukarov & Alex Rogers & Nicholas Jennings, 2011. "Task Assignment with Autonomous and Controlled Agents," Working Papers 004-11, International School of Economics at TSU, Tbilisi, Republic of Georgia.
    9. 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.
    10. Amirgaliyeva, Zhazira & Mladenović, Nenad & Todosijević, Raca & Urošević, Dragan, 2017. "Solving the maximum min-sum dispersion by alternating formulations of two different problems," European Journal of Operational Research, Elsevier, vol. 260(2), pages 444-459.
    11. 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.
    12. Ahuja, Ravindra K., 1997. "The balanced linear programming problem," European Journal of Operational Research, Elsevier, vol. 101(1), pages 29-38, August.
    13. 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.
    14. 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.
    15. 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.
    16. Péter Csóka & P. Jean-Jacques Herings, 2018. "Decentralized Clearing in Financial Networks," Management Science, INFORMS, vol. 64(10), pages 4681-4699, October.
    17. 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.
    18. Muralidharan S. Kodialam & Hanan Luss, 1998. "Algorithms for Separable Nonlinear Resource Allocation Problems," Operations Research, INFORMS, vol. 46(2), pages 272-284, April.
    19. Endre Bjørndal & Kurt Jörnsten, 2010. "Flow sharing and bankruptcy games," International Journal of Game Theory, Springer;Game Theory Society, vol. 39(1), pages 11-28, March.
    20. I. Stancu-Minasian & R. Caballero & E. Cerdá & M. Muñoz, 1999. "The stochastic bottleneck linear programming problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 7(1), pages 123-143, June.

    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:106:y:1998:i:1:p:177-183. 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.