Cost allocation in the Chinese postman problem
type: Item
instance of: scholarly article
title: Cost allocation in the Chinese postman problem
zbMATH Open document ID: 0945.90072
DOI: 10.1016/S0377-2217(98)00310-5
author: Herbert Hamers
author: Peter Borm
author: Robert L. M. J. van de Leensel
author: Stef Tijs
published in: European Journal of Operational Research
publication date: 2000-10-11T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 91A46
zbMATH DE Number: 1360734
zbMATH Keywords: chinese postman problem
zbMATH Keywords: cost allocation
zbMATH Keywords: delivery game
MaRDI profile type: Publication
cites work: On cost allocation for a spanning tree: A game theoretic approach
cites work: Cost allocation for a spanning tree
cites work: Q3844775
cites work: Q3755262
cites work: Matching, Euler tours and the Chinese postman
cites work: A generalized linear production model: A unifying model
cites work: Minimum cost spanning tree games
cites work: On the concavity of delivery games
cites work: Q5331036
cites work: Totally Balanced Games and Games of Flow
cites work: Equilibrium Points of Bimatrix Games
cites work: Cost allocation for steiner trees
cites work: Q5519709
cites work: On the core of linear production games
cites work: Traveling salesman games
cites work: Stochastic Games
cites work: On the core of a traveling salesman cost allocation game
description: scientific article; zbMATH DE number 1360734