Technical Note—On Traveling Salesman Games with Asymmetric Costs
DOI10.1287/OPRE.2013.1225zbMATH Open1291.91040OpenAlexW2149695277MaRDI QIDQ5166292FDOQ5166292
Nelson A. Uhan, Alejandro Toriello
Publication date: 26 June 2014
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.2013.1225
graphsnetworksinteger programmingcooperative gametraveling salesman problemgroup decisionsintegrality gapgames
Combinatorial optimization (90C27) Cooperative games (91A12) Integer programming (90C10) Games involving graphs (91A43)
Cited In (8)
- Dynamic cost allocation for economic lot sizing games
- Collaborative transportation with overlapping coalitions
- Stochastic linear programming games with concave preferences
- On the core of traveling salesman games
- A note on the equilibria of the unbounded traveler's dilemma
- A review on cost allocation methods in collaborative transportation
- Computing payoff allocations in the approximate core of linear programming games in a privacy-preserving manner
- Dynamic linear programming games with risk-averse players
Recommendations
- Title not available (Why is that?) 👍 👎
- On the Integrality Ratio for the Asymmetric Traveling Salesman Problem 👍 👎
- A note on the complexity of the asymmetric traveling salesman problem 👍 👎
- On the core of a traveling salesman cost allocation game 👍 👎
- On the core of traveling salesman games 👍 👎
- An asymmetric analogue of van der Veen conditions and the traveling salesman problem 👍 👎
- On the stochastic complexity of the asymmetric traveling salesman problem 👍 👎
- A note on the approximation of the asymmetric traveling salesman problem. 👍 👎
- Some remarks on two degrees of asymmetry in the traveling salesman problem 👍 👎
This page was built for publication: Technical Note—On Traveling Salesman Games with Asymmetric Costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5166292)
