One-way and two-way cost allocation in hub network problems

DOI10.1007/S00291-020-00573-1MaRDI QIDQ2178916zbMATH OpenOpenAlexFDO

Authors G. Bergantiños, Juan J. Vidal-Puga

Publication date 11 May 2020

Published in OR Spectrum (Search for Journal in Brave)

Full work available at URL https://mpra.ub.uni-muenchen.de/74875/1/MPRA_paper_74875.pdf

zbMATH Keywords

corecost allocationgame theoryhub networkShapley value

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Discrete location and assignment (90B80) Approximation methods and heuristics in mathematical programming (90C59) Cooperative games (91A12) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Environmental economics (natural resource models, harvesting, pollution, etc.) (91B76)

Recommendations

• A cost allocation problem arising in hub-spoke network systems
• On cost allocation in hub-like networks
• Hub network games
• On cost allocation in communication networks
• A network flow approach to cost allocation for rooted trees

Cites work

• A cost allocation problem arising in hub-spoke network systems
• A multi-objective, hub-and-spoke model to design and manage biofuel supply chains
• A new rule for source connection problems
• A new stable and more responsive cost sharing solution for minimum cost spanning tree problems
• Contributions to the Theory of Games (AM-40), Volume IV
• Cores of convex games
• Designing satellite communication networks by zero—one quadratic programming
• scientific article; zbMATH DE number 3078997 (Why is no real title available?)
• Hub network games
• Minimum cost arborescences
• Modeling cooperation on a class of distribution problems
• Network hub location problems: The state of the art
• On cost allocation in hub-like networks
• On obligation rules for minimum cost spanning tree problems
• On the set of extreme core allocations for minimal cost spanning tree problems
• Pricing traffic in a spanning network
• Production-inventory games: A new class of totally balanced combinatorial optimization games
• Service network design for freight transportation: a review
• Sharing a minimal cost spanning tree: beyond the folk solution
• Sharing the costs of cleaning a river: the upstream responsibility rule
• Stochastic air freight hub location and flight routes planning
• The stochastic p-hub center problem with service-level constraints

Cited in

(4)

• On cost allocation in hub-like networks
• A cost allocation problem arising in hub-spoke network systems
• On One Routing Problem with Non-Additive Cost Aggregation
• Hub network games

This page was built for publication: One-way and two-way cost allocation in hub network problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2178916)