On the equivalence between some local and global Chinese postman and traveling salesman graphs

DOI10.1016/S0166-218X(03)00225-7zbMath1032.05079OpenAlexW2154712576MaRDI QIDQ1421461

Daniel Granot, Herbert Hamers

Publication date: 26 January 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(03)00225-7

zbMATH Keywords

Traveling salesmanCooperative gameCoreChinese postmanSubmodularity

Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43) Applications of game theory (91A80) Combinatorial optimization (90C27) Eulerian and Hamiltonian graphs (05C45)

Related Items (9)

Characterizing convexity of games using marginal vectors ⋮ Operations research games: A survey. (With comments and rejoinder) ⋮ Chinese postman games with multi-located players ⋮ On graphs which can or cannot induce Chinese Postman games with a non-empty core ⋮ Graphs inducing totally balanced and submodular Chinese postman games ⋮ On the submodularity of multi-depot traveling salesman games ⋮ The \(k\)-centrum Chinese postman delivery problem and a related cost allocation game ⋮ On the properties of weighted minimum colouring games ⋮ On games arising from multi-depot Chinese postman problems

Cites Work

• Unnamed Item
• On the core of a traveling salesman cost allocation game
• Super-modularity: Applications to convex games and to the greedy algorithm for LP
• Traveling salesman games
• Cost allocation in the Chinese postman problem
• On some balanced, totally balanced and submodular delivery games
• Naturally submodular digraphs and forbidden digraph configurations
• Cores of convex games
• The kernel and bargaining set for convex games
• HOW TO HANDLE INTERVAL SOLUTIONS FOR COOPERATIVE INTERVAL GAMES
• Matching, Euler tours and the Chinese postman

This page was built for publication: On the equivalence between some local and global Chinese postman and traveling salesman graphs