Cost allocation in the Chinese postman problem

European Journal of Operational Research

Volumn 118, Issue 1, 1999, Pages 153-163

  Hamers, Herbert ^a   Borm, Peter ^a   Van De Leensel, Robert ^b   Tijs, Stef ^a  

^a TILBURG UNIVERSITY   (Netherlands)

^b MAASTRICHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COST EFFECTIVENESS; GAME THEORY; GRAPH THEORY; RESOURCE ALLOCATION;

BRIDGE-CONNECTED EULER GRAPH; COOPERATIVE COMBINATORIAL OPTIMIZATION GAMES; COST ALLOCATION;

TRAVELING SALESMAN PROBLEM;

EID: 0032641620     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(98)00310-5     Document Type: Article

References (19)

1. Bird, C., 1976. On cost allocation for a spanning tree: A game theoretic approach. Networks 6, 335-350.
2. Claus, A., Kleitman, D., 1973. Cost allocation for a spanning tree. Networks 3, 289-304.
3. Curiel, I., Pederzoli, G., Tijs, S., 1989. Sequencing games. European Journal of Operational Research 54, 323-334.
4. Dantzig, G.B., 1963. Linear Programming and Extensions. Princeton University Press, Princeton, NJ.
5. Derks, J., Tijs, S., 1986. Totally balanced multi-commodity games and flow games. Methods of Operations Research 54, 335-347.
6. Edmonds, J., Johnson, E., 1973. Matching, Euler tours and the Chinese postman. Mathematical Programming 5, 88-124.
7. Granot, D., 1986. A generalized linear production model: A unifying model. Mathematical Programming 34, 212-222.
8. Granot, D., Huberman, G., 1981. Minimum cost spanning tree games. Mathematical Programming 21, 1-18.
9. Granot, D., Hamers, H., Tijs, S., 1996. Weakly cyclic graphs and delivery games, Center Discussion paper 96110, Tilburg University, The Netherlands.
10. Hamers, H., 1997. On the concavity of delivery games. European Journal of Operational Research 99 (2), 445-458.
11. Isaacs, R., 1965. Differential Games, a Mathematical Theory with Applications to Warfare and Pursuit, Control and Optimization, Wiley, New York.
12. Kalai, E., Zemel, E., 1982. Totally balanced games and games of flow. Mathematics of Operations Research 7, 476-478.
13. Lemke, C., Howson, J., 1964. Equilibrium points of bimatrix games. Journal Social Industrial Applications Mathematics 12, 413-423.
14. Megiddo, N., 1978. Cost allocation for Steiner trees. Networks 8, 1-6.
15. Kwan, M.K., 1962. Graphic programming using odd or even points. Chinese Mathematics 1, 273-277.
16. Owen, 1975. On the core of linear production games. Mathematical Programming 9, 358-370.
17. Potters, J., Curiel, I., Tijs, S., 1992. Traveling salesman games. Mathematical Programming 53, 199-211.
18. Shapley, L., 1953. Stochastic games. Proceedings National Academic Sciences US 39, 1095-1100.
19. Tamir, A., 1989. On the core of a traveling salesman cost allocation game. Operations Research Letters 8, 31-34.