On the core of traveling salesman games
type: Item
instance of: scholarly article
title: On the core of traveling salesman games
zbMATH Open document ID: 1408.91020
author: Lei Sun
author: Mark H. Karwan
published in: Operations Research Letters
publication date: 2018-09-28T00:00:00Z
Mathematics Subject Classification ID: 91A12
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6945371
zbMATH Keywords: cooperative games
zbMATH Keywords: core
zbMATH Keywords: cost allocation
zbMATH Keywords: combinatorial optimization
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: j.orl.2015.04.008
OpenAlex ID: W2016193717
cites work: Q5417632
cites work: Finding the Exact Integrality Gap for Small Traveling Salesman Problems
cites work: On approximately fair cost allocation in Euclidean TSP games
cites work: Q4205235
cites work: Worst-case comparison of valid inequalities for the TSP
cites work: Survivable networks, linear programming relaxations and the parsimonious property
cites work: The Traveling-Salesman Problem and Minimum Spanning Trees
cites work: A note on the 5-person traveling salesman game
cites work: Q5187226
cites work: Integer Programming Formulation of Traveling Salesman Problems
cites work: Traveling salesman games with the Monge property
cites work: On the core of linear production games
cites work: Traveling salesman games
cites work: Analyzing the Held-Karp TSP bound: A monotonicity property with application
cites work: On the core of a traveling salesman cost allocation game
cites work: Technical Note—On Traveling Salesman Games with Asymmetric Costs
DOI: 10.1016/J.ORL.2015.04.008
description: scientific article; zbMATH DE number 6945371