On the core of traveling salesman games

DOI10.1016/j.orl.2015.04.008zbMath1408.91020OpenAlexW2016193717MaRDI QIDQ1785381

Mark H. Karwan, Lei Sun

Publication date: 28 September 2018

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2015.04.008

zbMATH Keywords

cooperative gamescombinatorial optimizationcorecost allocation

Mathematics Subject Classification ID

Cooperative games (91A12) Combinatorial optimization (90C27)

Related Items (3)

Cooperation of customers in traveling salesman problems with profits ⋮ Approximate core allocations for edge cover games ⋮ The indefinite period traveling salesman problem

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Survivable networks, linear programming relaxations and the parsimonious property
• Analyzing the Held-Karp TSP bound: A monotonicity property with application
• On the core of a traveling salesman cost allocation game
• Traveling salesman games
• On approximately fair cost allocation in Euclidean TSP games
• Traveling salesman games with the Monge property
• Worst-case comparison of valid inequalities for the TSP
• A note on the 5-person traveling salesman game
• Finding the Exact Integrality Gap for Small Traveling Salesman Problems
• Integer Programming Formulation of Traveling Salesman Problems
• On the core of linear production games
• Technical Note—On Traveling Salesman Games with Asymmetric Costs
• The Traveling-Salesman Problem and Minimum Spanning Trees

This page was built for publication: On the core of traveling salesman games