Technical Note—On Traveling Salesman Games with Asymmetric Costs
From MaRDI portal
Publication:5166292
Recommendations
- A note on the complexity of the asymmetric traveling salesman problem
- A note on the approximation of the asymmetric traveling salesman problem.
- On the core of a traveling salesman cost allocation game
- scientific article; zbMATH DE number 4039668
- On the core of traveling salesman games
- Some remarks on two degrees of asymmetry in the traveling salesman problem
- On the Integrality Ratio for the Asymmetric Traveling Salesman Problem
- An asymmetric analogue of van der Veen conditions and the traveling salesman problem
- On the stochastic complexity of the asymmetric traveling salesman problem
Cited in
(9)- Dynamic cost allocation for economic lot sizing games
- A note on the equilibria of the unbounded traveler's dilemma
- A review on cost allocation methods in collaborative transportation
- On the submodularity of multi-depot traveling salesman games
- On the core of traveling salesman games
- Computing payoff allocations in the approximate core of linear programming games in a privacy-preserving manner
- Collaborative transportation with overlapping coalitions
- Stochastic linear programming games with concave preferences
- Dynamic linear programming games with risk-averse players
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)
