On some balanced, totally balanced and submodular delivery games

DOI10.1007/s101070050093zbMath1028.91510OpenAlexW2074295291MaRDI 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 gamesChinese postman problem

Mathematics Subject Classification ID

Cooperative games (91A12) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Paths and cycles (05C38)

Related Items (19)

Operations research games: A survey. (With comments and rejoinder) ⋮ Highway games on weakly cyclic graphs ⋮ Submodularity and the traveling salesman problem ⋮ 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 ⋮ Naturally submodular digraphs and forbidden digraph configurations ⋮ Graphs inducing totally balanced and submodular Chinese postman games ⋮ Approximately fair cost allocation in metric traveling salesman games ⋮ On the submodularity of multi-depot traveling salesman games ⋮ The \(k\)-centrum Chinese postman delivery problem and a related cost allocation game ⋮ Monotonic stable solutions for minimum coloring games ⋮ On Chinese postman games where residents of each road pay the cost of their road ⋮ A competitive solution for cooperative truckload delivery ⋮ Collaboration in Cargo Transportation ⋮ ASSIGNMENT SITUATIONS WITH MULTIPLE OWNERSHIP AND THEIR GAMES ⋮ Traveling salesman games with the Monge property ⋮ On the properties of weighted minimum colouring games ⋮ On games arising from multi-depot Chinese postman problems

This page was built for publication: On some balanced, totally balanced and submodular delivery games