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

Fuzzy sharing problem by possibility measure

Author

Listed:
  • Itoh, Takeshi
  • Ishii, Hiroaki

Abstract

No abstract is available for this item.

Suggested Citation

  • Itoh, Takeshi & Ishii, Hiroaki, 1997. "Fuzzy sharing problem by possibility measure," European Journal of Operational Research, Elsevier, vol. 102(3), pages 648-656, November.
    • Handle: RePEc:eee:ejores:v:102:y:1997:i:3:p:648-656
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(96)00244-5
    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.
    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. 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.
    2. 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.
    3. Péter Csóka & P. Jean-Jacques Herings, 2018. "Decentralized Clearing in Financial Networks," Management Science, INFORMS, vol. 64(10), pages 4681-4699, October.
    4. 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.
    5. Wang, Yang & Wu, Qinghua & Glover, Fred, 2017. "Effective metaheuristic algorithms for the minimum differential dispersion problem," European Journal of Operational Research, Elsevier, vol. 258(3), pages 829-843.
    6. David Hartvigsen, 1998. "A Submodular Optimization Problem with Side Constraints," Mathematics of Operations Research, INFORMS, vol. 23(3), pages 661-679, August.
    7. 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.
    8. Rahmi İlkılıç & Çağatay Kayı, 2014. "Allocation rules on networks," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 43(4), pages 877-892, December.
    9. 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.
    10. Csoka, Péter & Herings, P. Jean-Jacques, 2016. "Decentralized Clearing in Financial Networks (RM/16/005-revised-)," Research Memorandum 037, Maastricht University, Graduate School of Business and Economics (GSBE).
    11. 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.
    12. Ahuja, Ravindra K., 1997. "The balanced linear programming problem," European Journal of Operational Research, Elsevier, vol. 101(1), pages 29-38, August.
    13. Prokopyev, Oleg A. & Kong, Nan & Martinez-Torres, Dayna L., 2009. "The equitable dispersion problem," European Journal of Operational Research, Elsevier, vol. 197(1), pages 59-67, August.
    14. Katta, Akshay-Kumar & Sethuraman, Jay, 2006. "A solution to the random assignment problem on the full preference domain," Journal of Economic Theory, Elsevier, vol. 131(1), pages 231-250, November.

    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:102:y:1997:i:3:p:648-656. 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.