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

Threshold based discounting networks: The cost allocation provided by the nucleolus

Author

Listed:
  • Skorin-Kapov, Darko
  • Skorin-Kapov, Jadranka

Abstract

No abstract is available for this item.

Suggested Citation

  • Skorin-Kapov, Darko & Skorin-Kapov, Jadranka, 2005. "Threshold based discounting networks: The cost allocation provided by the nucleolus," European Journal of Operational Research, Elsevier, vol. 166(1), pages 154-159, October.
  • Handle: RePEc:eee:ejores:v:166:y:2005:i:1:p:154-159
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(04)00218-8
    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. Skorin-Kapov, Darko & Skorin-Kapov, Jadranka, 1994. "On tabu search for the location of interacting hub facilities," European Journal of Operational Research, Elsevier, vol. 73(3), pages 502-509, March.
    2. Daniel Granot & Frieda Granot, 1992. "On Some Network Flow Games," Mathematics of Operations Research, INFORMS, vol. 17(4), pages 792-841, November.
    3. O'Kelly, M. E. & Bryan, D. L., 1998. "Hub location with flow economies of scale," Transportation Research Part B: Methodological, Elsevier, vol. 32(8), pages 605-616, November.
    4. SCHMEIDLER, David, 1969. "The nucleolus of a characteristic function game," LIDAM Reprints CORE 44, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    5. Darko Skorin-Kapov, 2001. "On Cost Allocation in Hub-Like Networks," Annals of Operations Research, Springer, vol. 106(1), pages 63-78, September.
    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. Kratica, Jozef & Stanimirovic, Zorica & Tosic, Dusan & Filipovic, Vladimir, 2007. "Two genetic algorithms for solving the uncapacitated single allocation p-hub median problem," European Journal of Operational Research, Elsevier, vol. 182(1), pages 15-28, October.
    2. Cunha, Claudio B. & Silva, Marcos Roberto, 2007. "A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil," European Journal of Operational Research, Elsevier, vol. 179(3), pages 747-758, June.
    3. Guajardo, Mario & Jörnsten, Kurt, 2015. "Common mistakes in computing the nucleolus," European Journal of Operational Research, Elsevier, vol. 241(3), pages 931-935.
    4. Mariusz Kaleta & Eugeniusz Toczyłowski, 2009. "A cost allocation framework for LP and GLP games," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 19(4), pages 27-46.
    5. Darko Skorin-Kapov, 2018. "Social enterprise tree network games," Annals of Operations Research, Springer, vol. 268(1), pages 5-20, September.
    6. Mariusz Kaleta & Eugeniusz Toczylowski, 2009. "A cost allocation framework for lp and glp games," Operations Research and Decisions, Wroclaw University of Technology, Institute of Organization and Management, vol. 4, pages 27-46.

    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. James F. Campbell & Morton E. O'Kelly, 2012. "Twenty-Five Years of Hub Location Research," Transportation Science, INFORMS, vol. 46(2), pages 153-169, May.
    2. Dhyani, Sneha & Jayaswal, Sachin & Sinha, Ankur & Vidyarthi, Navneet, 2019. "Alternate Second Order Conic Programming Reformulations for Hub Location with Capacity Selection under Demand," IIMA Working Papers WP 2018-12-04, Indian Institute of Management Ahmedabad, Research and Publication Department.
    3. Ricardo Saraiva de Camargo & Gilberto de Miranda & Henrique Pacca L. Luna, 2009. "Benders Decomposition for Hub Location Problems with Economies of Scale," Transportation Science, INFORMS, vol. 43(1), pages 86-97, February.
    4. Daniel Granot & Jeroen Kuipers & Sunil Chopra, 2002. "Cost Allocation for a Tree Network with Heterogeneous Customers," Mathematics of Operations Research, INFORMS, vol. 27(4), pages 647-661, November.
    5. Cruijssen, F., 2006. "Horizontal cooperation in transport and logistics," Other publications TiSEM ab6dbe68-aebc-4b03-8eea-d, Tilburg University, School of Economics and Management.
    6. O. Tejada & M. Álvarez-Mozos, 2016. "Vertical syndication-proof competitive prices in multilateral assignment markets," Review of Economic Design, Springer;Society for Economic Design, vol. 20(4), pages 289-327, December.
    7. Kratica, Jozef & Stanimirovic, Zorica & Tosic, Dusan & Filipovic, Vladimir, 2007. "Two genetic algorithms for solving the uncapacitated single allocation p-hub median problem," European Journal of Operational Research, Elsevier, vol. 182(1), pages 15-28, October.
    8. Marina Nunez Oliva & Carlos Rafels Pallarola, 2005. "Uniform-price assignment markets," Working Papers in Economics 135, Universitat de Barcelona. Espai de Recerca en Economia.
    9. Hsu, Chaug-Ing & Wen, Yuh-Horng, 2002. "Reliability evaluation for airline network design in response to fluctuation in passenger demand," Omega, Elsevier, vol. 30(3), pages 197-213, June.
    10. Walter Kern & Daniël Paulusma, 2009. "On the Core and f -Nucleolus of Flow Games," Mathematics of Operations Research, INFORMS, vol. 34(4), pages 981-991, November.
    11. Podnar, Hrvoje & Skorin-Kapov, Jadranka & Skorin-Kapov, Darko, 2002. "Network cost minimization using threshold-based discounting," European Journal of Operational Research, Elsevier, vol. 137(2), pages 371-386, March.
    12. Tamás Solymosi, 2015. "The kernel is in the least core for permutation games," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 23(4), pages 795-809, December.
    13. Trung Hieu Tran & Jesse R. O’Hanley & M. Paola Scaparra, 2017. "Reliable Hub Network Design: Formulation and Solution Techniques," Transportation Science, INFORMS, vol. 51(1), pages 358-375, February.
    14. Oriol Tejada & Carles Rafels, 2010. "Symmetrically multilateral-bargained allocations in multi-sided assignment markets," International Journal of Game Theory, Springer;Game Theory Society, vol. 39(1), pages 249-258, March.
    15. Niknamfar, Amir Hossein & Niaki, Seyed Taghi Akhavan, 2016. "Fair profit contract for a carrier collaboration framework in a green hub network under soft time-windows: Dual lexicographic max–min approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 91(C), pages 129-151.
    16. Ata Atay & Marina Núñez, 2019. "Multi-sided assignment games on m-partite graphs," Annals of Operations Research, Springer, vol. 279(1), pages 271-290, August.
    17. Alumur, Sibel & Kara, Bahar Y., 2008. "Network hub location problems: The state of the art," European Journal of Operational Research, Elsevier, vol. 190(1), pages 1-21, October.
    18. J. F. Campbell & A. T. Ernst & M. Krishnamoorthy, 2005. "Hub Arc Location Problems: Part I---Introduction and Results," Management Science, INFORMS, vol. 51(10), pages 1540-1555, October.
    19. Racunica, Illia & Wynter, Laura, 2005. "Optimal location of intermodal freight hubs," Transportation Research Part B: Methodological, Elsevier, vol. 39(5), pages 453-477, June.
    20. F.Javier Martínez-de-Albéniz & Carles Rafels & Neus Ybern, 2015. "Insights into the nucleolus of the assignment game," UB School of Economics Working Papers 2015/333, University of Barcelona School of Economics.

    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:166:y:2005:i:1:p:154-159. 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.