A cost allocation problem arising in hub-spoke network systems

DOI10.1016/j.ejor.2003.05.002zbMath1061.90015OpenAlexW2057237283WikidataQ57549473 ScholiaQ57549473MaRDI QIDQ1885769

Nobuo Matsubayashi, Hisakazu Nishino, Yasushi Masuda, Masashi Umezawa

Publication date: 12 November 2004

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2003.05.002

zbMATH Keywords

Game theoryCost allocationCore allocationHub-spoke network systemNon-excludabilityTelecommunication network

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Discrete location and assignment (90B80)

Related Items

One-way and two-way cost allocation in hub network problems, Further insights into the allocation of greenhouse gas emissions to shipments in road freight transportation: the pollution routing game, QoS commitment between vertically integrated autonomous systems, Cooperative games and cost allocation problems, Optimization of hybrid hub-and-spoke network operation for less-than-truckload freight transportation considering incremental quantity discount, Cost Sharing in Production Economies, Cooperative interconnection settlement among ISPs through NAP, Improved weighted Shapley Value model for the fourth party logistics supply chain coalition, Congestion network problems and related games, Threshold based discounting networks: the cost allocation provided by the nucleolus, Public congestion network situations and related games, Supplier-initiated outsourcing: a methodology to exploit synergy in transportation

Cites Work

• Unnamed Item
• A quadratic integer program for the location of interacting hub facilities
• Traveling salesman games
• Optimal design of a distributed network with a two-level hierarchical structure
• Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
• Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
• Cost allocation in the Chinese postman problem
• On a cost allocation problem arising from a capacitated concentrator covering problem
• Integer programming formulations of discrete hub location problems
• An Efficient Procedure for Designing Single Allocation Hub and Spoke Systems
• Telecommunication Node Clustering with Node Compatibility and Network Survivability Requirements
• Designing satellite communication networks by zero—one quadratic programming
• Minimum cost spanning tree games
• Efficient algorithms for the uncapacitated single allocation p-hub median problem
• Hub Location and the p-Hub Median Problem
• Hub network games
• Lower Bounds for the Hub Location Problem
• Optimal Incentive-Compatible Priority Pricing for the M/M/1 Queue
• The Regulation of Queue Size by Levying Tolls