Traveling salesman games
From MaRDI portal
Publication:1184345
DOI10.1007/BF01585702zbMath0749.90094OpenAlexW2067509122MaRDI QIDQ1184345
S. H. Tijs, Imma J. Curiel, Jos A. M. Potters
Publication date: 28 June 1992
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01585702
Related Items (45)
Lagrangian heuristic for simultaneous subsidization and penalization: implementations on rooted travelling salesman games ⋮ Social enterprise tree network games ⋮ A note on Steiner tree games ⋮ A cost allocation problem arising in hub-spoke network systems ⋮ Operations research games: A survey. (With comments and rejoinder) ⋮ Stochastic linear programming games with concave preferences ⋮ Core-based cost allocation in the cooperative traveling salesman problem ⋮ Component Acquisition Games ⋮ New techniques for cost sharing in combinatorial optimization games ⋮ Coincidence of cooperative game theoretic solutions in the appointment problem ⋮ On the core of routing games ⋮ Stable solutions for multiple scenario cost allocation games with partial information ⋮ Highway games on weakly cyclic graphs ⋮ On the core of a traveling salesman cost allocation game ⋮ On approximately fair cost allocation in Euclidean TSP games ⋮ Computing payoff allocations in the approximate core of linear programming games in a privacy-preserving manner ⋮ Cooperative game‐theoretic features of cost sharing in location‐routing ⋮ Cooperation of customers in traveling salesman problems with profits ⋮ The pairwise egalitarian solution. ⋮ Approximate core allocations for edge cover games ⋮ Further insights into the allocation of greenhouse gas emissions to shipments in road freight transportation: the pollution routing game ⋮ Computing Near-Optimal Stable Cost Allocations for Cooperative Games by Lagrangian Relaxation ⋮ Characterizing the Shapley value in fixed-route traveling salesman problems with appointments ⋮ Pairwise solutions and the core of transportation situations ⋮ On the equivalence between some local and global Chinese postman and traveling salesman graphs ⋮ Approximating the least core value and least core of cooperative games with supermodular costs ⋮ Approximately fair cost allocation in metric traveling salesman games ⋮ On the submodularity of multi-depot traveling salesman games ⋮ Monotonic stable solutions for minimum coloring games ⋮ On the core of cost-revenue games: minimum cost spanning tree games with revenues ⋮ On the core of routing games with revenues ⋮ The traveling salesman game for cost allocation: the case study of the bus service in Castellanza ⋮ On the core of multiple longest traveling salesman games ⋮ On the core of traveling salesman games ⋮ Compromise values in cooperative game theory ⋮ A review on cost allocation methods in collaborative transportation ⋮ On the core of network synthesis games ⋮ On the concavity of delivery games ⋮ Traveling salesman games with the Monge property ⋮ Cost allocation in the Chinese postman problem ⋮ Cooperation in one machine scheduling ⋮ A note on the 5-person traveling salesman game ⋮ On some approximately balanced combinatorial cooperative games ⋮ On games arising from multi-depot Chinese postman problems ⋮ On Analyzing Cost Allocation Problems: Cooperation Building Structures and Order Problem Representations
Cites Work
This page was built for publication: Traveling salesman games
