On some balanced, totally balanced and submodular delivery games

DOI10.1007/s101070050093zbMath1028.91510MaRDI QIDQ1961984

Herbert Hamers, S. H. Tijs, Daniel Granot

Publication date: 27 January 2004

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://research.tilburguniversity.edu/en/publications/e0496604-0162-4a27-992c-a6e14896c6b2

zbMATH Keywords

cooperative games; Chinese postman problem

Mathematics Subject Classification ID

91A12: Cooperative games

90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)

05C38: Paths and cycles

Related Items

A competitive solution for cooperative truckload delivery, On games arising from multi-depot Chinese postman problems, On graphs which can or cannot induce Chinese Postman games with a non-empty core, 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, Approximately fair cost allocation in metric traveling salesman games, Submodularity and the traveling salesman problem, Operations research games: A survey. (With comments and rejoinder), On the equivalence between some local and global Chinese postman and traveling salesman graphs, On the submodularity of multi-depot traveling salesman games, Traveling salesman games with the Monge property, Naturally submodular digraphs and forbidden digraph configurations, Chinese postman games with multi-located players, Monotonic stable solutions for minimum coloring games, Graphs inducing totally balanced and submodular Chinese postman games, Highway games on weakly cyclic graphs, ASSIGNMENT SITUATIONS WITH MULTIPLE OWNERSHIP AND THEIR GAMES, Collaboration in Cargo Transportation