On the submodularity of multi-depot traveling salesman games
type: Item
instance of: scholarly article
title: On the submodularity of multi-depot traveling salesman games
zbMATH Open document ID: 1419.91161
author: Trine Tornøe Platz
published in: Discrete Applied Mathematics
publication date: 2019-02-20T00:00:00Z
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 91A12
Mathematics Subject Classification ID: 05C90
zbMATH DE Number: 7027127
zbMATH Keywords: Steiner traveling salesman problem
zbMATH Keywords: cooperative game
zbMATH Keywords: submodularity
MaRDI profile type: Publication
OpenAlex ID: W2740562552
cites work: Sequencing and Cooperation
cites work: Totally balanced combinatorial optimization games
cites work: Naturally submodular digraphs and forbidden digraph configurations
cites work: On the equivalence between some local and global Chinese postman and traveling salesman graphs
cites work: On some balanced, totally balanced and submodular delivery games
cites work: Minimum cost spanning tree games
cites work: Characterizations of Natural Submodular Graphs: A Polynomially Solvable Class of the TSP
cites work: Compact formulations of the Steiner traveling salesman problem and related problems
cites work: The kernel and bargaining set for convex games
cites work: On games arising from multi-depot Chinese postman problems
cites work: Traveling salesman games
cites work: Cores of convex games
cites work: On the core of a traveling salesman cost allocation game
Wikidata QID: Q128719452
DOI: 10.1016/J.DAM.2018.11.029
description: scientific article; zbMATH DE number 7027127