On approximately fair cost allocation in Euclidean TSP games

DOI10.1007/BF01545526zbMath0897.90199MaRDI QIDQ1384221

Ulrich Faigle, Walter Kern, Sándor P. Fekete, Winfried Hochstättler

Publication date: 13 April 1998

Published in: OR Spektrum (Search for Journal in Brave)

zbMATH Keywords

corecost allocationcooperative gameHeld-Karp boundoptimal traveling salesman tour

Mathematics Subject Classification ID

Cooperative games (91A12) Linear programming (90C05)

Related Items

Approximate core allocations and integrality gap for the bin packing game, New techniques for cost sharing in combinatorial optimization games, Approximation of the Shapley value for the Euclidean travelling salesman game, Strategic cooperation in cost sharing games, Approximate core allocations for edge cover games, Computing Near-Optimal Stable Cost Allocations for Cooperative Games by Lagrangian Relaxation, A system-theoretic model for cooperation, interaction and allocation, On the complexity of core, kernel, and bargaining set, Approximately fair cost allocation in metric traveling salesman games, The travelling preacher, projection, and a lower bound for the stability number of a graph, Unnamed Item, On the core of traveling salesman games, The indefinite period traveling salesman problem, Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value, A review on cost allocation methods in collaborative transportation, Traveling salesman games with the Monge property, Geometric spanner games, Computing Shapley values in the plane

Cites Work

• On the core of network synthesis games
• Optimizing over the subtour polytope of the travelling salesman problem
• Analyzing the Held-Karp TSP bound: A monotonicity property with application
• On the core of a traveling salesman cost allocation game
• The ellipsoid method and its consequences in combinatorial optimization
• Traveling salesman games
• On the complexity of testing membership in the core of min-cost spanning tree games
• On some approximately balanced combinatorial cooperative games
• The irreducible Core of a minimum cost spanning tree game
• Trees and Cuts
• The traveling salesman problem on a graph and some related integer polyhedra
• On the symmetric travelling salesman problem: A computational study
• Heuristic analysis, linear programming and branch and bound
• Minimum cost spanning tree games
• Odd Minimum Cut-Sets and b-Matchings
• On the core of linear production games
• On cost allocation for a spanning tree: A game theoretic approach
• On Linear Characterizations of Combinatorial Optimization Problems
• Probabilistic and Worst Case Analyses of Classical Problems of Combinatorial Optimization in Euclidean Space
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item