On the submodularity of multi-depot traveling salesman games

DOI10.1016/j.dam.2018.11.029zbMath1419.91161OpenAlexW2740562552WikidataQ128719452 ScholiaQ128719452MaRDI QIDQ1727725

Trine Tornøe Platz

Publication date: 20 February 2019

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

Full work available at URL: http://hdl.handle.net/10398/573f4b87-05d2-48d1-b2ff-3aeea9bf263d

zbMATH Keywords

submodularitycooperative gameSteiner traveling salesman problem

Mathematics Subject Classification ID

Applications of graph theory (05C90) Cooperative games (91A12) Games involving graphs (91A43)

Related Items (1)

On the convexity of independent set games

Cites Work

• On games arising from multi-depot Chinese postman problems
• Compact formulations of the Steiner traveling salesman problem and related problems
• On the core of a traveling salesman cost allocation game
• Traveling salesman games
• On the equivalence between some local and global Chinese postman and traveling salesman graphs
• Totally balanced combinatorial optimization games
• 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
• Minimum cost spanning tree games
• Sequencing and Cooperation
• Characterizations of Natural Submodular Graphs: A Polynomially Solvable Class of the TSP

This page was built for publication: On the submodularity of multi-depot traveling salesman games