On games arising from multi-depot Chinese postman problems
From MaRDI portal
Publication:256685
DOI10.1007/s10479-015-1977-3zbMath1358.91015OpenAlexW1563499786MaRDI QIDQ256685
Trine Tornøe Platz, Herbert Hamers
Publication date: 9 March 2016
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://pure.uvt.nl/ws/files/1487722/2013-005.pdf
Programming involving graphs or networks (90C35) Cooperative games (91A12) Games involving graphs (91A43) Combinatorial optimization (90C27) Games on graphs (graph-theoretic aspects) (05C57)
Related Items
On the submodularity of multi-depot traveling salesman games ⋮ On how to allocate the fixed cost of transport systems ⋮ Revenue sharing for resource reallocation among project activity contractors ⋮ A competitive solution for cooperative truckload delivery
Cites Work
- Unnamed Item
- A game theoretical approach to sharing penalties and rewards in projects
- 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
- Stable sets in one-seller assignment games
- New upper bounds for the multi-depot capacitated arc routing problem
- Cooperative game theory and inventory management
- On the convexity of precedence sequencing games
- Balancedness of sequencing games with multiple parallel machines
- Sharing a minimal cost spanning tree: beyond the folk solution
- Traveling salesman games
- The traveling salesman game: An application of cost allocation in a gas and oil company
- On the concavity of delivery games
- Cost allocation in the Chinese postman problem
- On the equivalence between some local and global Chinese postman and traveling salesman graphs
- Submodularity of some classes of the combinatorial optimization games
- Inventory games.
- Totally balanced combinatorial optimization games
- How to distribute costs associated with a delayed project
- On some balanced, totally balanced and submodular delivery games
- Monotonic stable solutions for minimum coloring games
- Graphs inducing totally balanced and submodular Chinese postman games
- Cores of convex games
- The assignment game. I: The core
- The kernel and bargaining set for convex games
- A Decade of Capacitated Arc Routing
- A generalized linear production model: A unifying model
- Minimum cost spanning tree games
- On the core of linear production games
- A fundamental problem in vehicle routing
- Matching, Euler tours and the Chinese postman
