Technical Note—On Traveling Salesman Games with Asymmetric Costs
From MaRDI portal
Publication:5166292
DOI10.1287/opre.2013.1225zbMath1291.91040OpenAlexW2149695277MaRDI QIDQ5166292
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
integer programmingnetworksgraphstraveling salesman problemcooperative gamegamesintegrality gapgroup decisions
Integer programming (90C10) Cooperative games (91A12) Games involving graphs (91A43) Combinatorial optimization (90C27)
Related Items (7)
Stochastic linear programming games with concave preferences ⋮ Dynamic cost allocation for economic lot sizing games ⋮ Computing payoff allocations in the approximate core of linear programming games in a privacy-preserving manner ⋮ Dynamic linear programming games with risk-averse players ⋮ On the core of traveling salesman games ⋮ Collaborative transportation with overlapping coalitions ⋮ A review on cost allocation methods in collaborative transportation
This page was built for publication: Technical Note—On Traveling Salesman Games with Asymmetric Costs
