Cost allocation in the Chinese postman problem

DOI10.1016/S0377-2217(98)00310-5zbMath0945.90072MaRDI QIDQ1307816

Herbert Hamers, P. E. M. Borm, Robert L. M. J. van de Leensel, S. H. Tijs

Publication date: 11 October 2000

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

zbMATH Keywords

cost allocationchinese postman problemdelivery game

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial games (91A46)

Related Items (11)

A cost allocation problem arising in hub-spoke network systems ⋮ Operations research games: A survey. (With comments and rejoinder) ⋮ Chinese postman games with multi-located players ⋮ On graphs which can or cannot induce Chinese Postman games with a non-empty core ⋮ On the equivalence between some local and global Chinese postman and traveling salesman graphs ⋮ Graphs inducing totally balanced and submodular Chinese postman games ⋮ The \(k\)-centrum Chinese postman delivery problem and a related cost allocation game ⋮ On Chinese postman games where residents of each road pay the cost of their road ⋮ A competitive solution for cooperative truckload delivery ⋮ A review on cost allocation methods in collaborative transportation ⋮ On games arising from multi-depot Chinese postman problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the core of a traveling salesman cost allocation game
• Traveling salesman games
• On the concavity of delivery games
• A generalized linear production model: A unifying model
• Minimum cost spanning tree games
• Totally Balanced Games and Games of Flow
• On the core of linear production games
• Cost allocation for a spanning tree
• On cost allocation for a spanning tree: A game theoretic approach
• Cost allocation for steiner trees
• Matching, Euler tours and the Chinese postman
• Equilibrium Points of Bimatrix Games
• Stochastic Games

This page was built for publication: Cost allocation in the Chinese postman problem