On the core of a traveling salesman cost allocation game

DOI10.1016/0167-6377(89)90030-8zbMath0675.90102OpenAlexW1985531479MaRDI QIDQ1122517

Arie Tamir

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0167-6377(89)90030-8

zbMATH Keywords

corecost allocationhypohamiltonian graphstraveling salesman gametrip cost

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Cooperative games (91A12) Paths and cycles (05C38)

Related Items

Lagrangian heuristic for simultaneous subsidization and penalization: implementations on rooted travelling salesman games, Operations research games: A survey. (With comments and rejoinder), New techniques for cost sharing in combinatorial optimization games, On the core of routing games, On the nucleolus of the basic vehicle routing game, On approximately fair cost allocation in Euclidean TSP games, Minimum cost spanning tree games and spillover stability, Cooperation of customers in traveling salesman problems with profits, Computing Near-Optimal Stable Cost Allocations for Cooperative Games by Lagrangian Relaxation, Characterizing the Shapley value in fixed-route traveling salesman problems with appointments, Cooperative location games based on the minimum diameter spanning Steiner subgraph problem, On the equivalence between some local and global Chinese postman and traveling salesman graphs, Approximately fair cost allocation in metric traveling salesman games, On the submodularity of multi-depot traveling salesman games, The core of some location games, Traveling salesman games, On the core of routing games with revenues, On the core of multiple longest traveling salesman games, Juegos con corazon no vacio. Una nueva caracterizacion, On the core of traveling salesman games, Compromise values in cooperative game theory, A review on cost allocation methods in collaborative transportation, Simultaneous Penalization and Subsidization for Stabilizing Grand Cooperation, On the core of network synthesis games, Traveling salesman games with the Monge property, COST SHARING IN NETWORKS: SOME OPEN QUESTIONS, Cost allocation in the Chinese postman problem, A note on the 5-person traveling salesman game, On some approximately balanced combinatorial cooperative games

Cites Work

• Unnamed Item
• On the core of network synthesis games
• Cost allocation: The traveling salesman, bin packing, and the knapsack
• The traveling salesman problem in graphs with some excluded minors
• Traveling salesman games
• On the core and nucleolus of minimum cost spanning tree games
• A generalized linear production model: A unifying model
• Minimum cost spanning tree games
• Cost allocation for steiner trees
• Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs