A cost allocation problem arising in hub-spoke network systems
type: Item
instance of: scholarly article
title: A cost allocation problem arising in hub-spoke network systems
zbMATH Open document ID: 1061.90015
author: Nobuo Matsubayashi
author: Masashi Umezawa
author: Yasushi Masuda
author: Hisakazu Nishino
published in: European Journal of Operational Research
publication date: 2004-11-12T00:00:00Z
Mathematics Subject Classification ID: 90B18
Mathematics Subject Classification ID: 90B80
zbMATH DE Number: 2115191
zbMATH Keywords: Game theory
zbMATH Keywords: Cost allocation
zbMATH Keywords: Hub-spoke network system
zbMATH Keywords: Non-excludability
zbMATH Keywords: Core allocation
zbMATH Keywords: Telecommunication network
MaRDI profile type: Publication
full work available at URL: j.ejor.2003.05.002
OpenAlex ID: W2057237283
Wikidata QID: Q57549473
cites work: Integer programming formulations of discrete hub location problems
cites work: Hub Location and the p-Hub Median Problem
cites work: Q3147668
cites work: Optimal design of a distributed network with a two-level hierarchical structure
cites work: Efficient algorithms for the uncapacitated single allocation p-hub median problem
cites work: Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
cites work: Minimum cost spanning tree games
cites work: Cost allocation in the Chinese postman problem
cites work: Designing satellite communication networks by zero—one quadratic programming
cites work: Optimal Incentive-Compatible Priority Pricing for the M/M/1 Queue
cites work: The Regulation of Queue Size by Levying Tolls
cites work: A quadratic integer program for the location of interacting hub facilities
cites work: Lower Bounds for the Hub Location Problem
cites work: Telecommunication Node Clustering with Node Compatibility and Network Survivability Requirements
cites work: An efficient procedure for designing single allocation hub and spoke systems
cites work: Traveling salesman games
cites work: On a cost allocation problem arising from a capacitated concentrator covering problem
cites work: Hub network games
cites work: Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
DOI: 10.1016/J.EJOR.2003.05.002
description: scientific article; zbMATH DE number 2115191