On approximately fair cost allocation in Euclidean TSP games
type: Item
instance of: scholarly article
title: On approximately fair cost allocation in Euclidean TSP games
zbMATH Open document ID: 0897.90199
DOI: 10.1007/BF01545526
author: U. Faigle
author: Sándor P. Fekete
author: Winfried. Hochstättler
author: Walter Kern
published in: OR Spektrum
publication date: 1998-04-13T00:00:00Z
Mathematics Subject Classification ID: 91A12
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 1140247
zbMATH Keywords: cooperative game
zbMATH Keywords: core
zbMATH Keywords: cost allocation
zbMATH Keywords: Held-Karp bound
zbMATH Keywords: optimal traveling salesman tour
MaRDI profile type: Publication
cites work: The irreducible Core of a minimum cost spanning tree game
cites work: On cost allocation for a spanning tree: A game theoretic approach
cites work: Optimizing over the subtour polytope of the travelling salesman problem
cites work: The traveling salesman problem on a graph and some related integer polyhedra
cites work: On some approximately balanced combinatorial cooperative games
cites work: On the complexity of testing membership in the core of min-cost spanning tree games
cites work: Q5624436
cites work: Minimum cost spanning tree games
cites work: The ellipsoid method and its consequences in combinatorial optimization
cites work: Q4036709
cites work: On Linear Characterizations of Combinatorial Optimization Problems
cites work: Q4040221
cites work: Q5844986
cites work: On the core of linear production games
cites work: On the symmetric travelling salesman problem: A computational study
cites work: Odd Minimum Cut-Sets and b-Matchings
cites work: Trees and Cuts
cites work: Traveling salesman games
cites work: Analyzing the Held-Karp TSP bound: A monotonicity property with application
cites work: Q3934171
cites work: Probabilistic and Worst Case Analyses of Classical Problems of Combinatorial Optimization in Euclidean Space
cites work: On the core of a traveling salesman cost allocation game
cites work: On the core of network synthesis games
cites work: Heuristic analysis, linear programming and branch and bound
Recommended article: Approximately fair cost allocation in metric traveling salesman games
Recommended article: Approximation and Online Algorithms
Recommended article: Improved Bounds for Facility Location Games with Fair Cost Allocation
Recommended article: Fair cost-sharing methods for the minimum spanning tree game
Recommended article: On the core of a traveling salesman cost allocation game
Recommended article: Approximation of the Shapley value for the Euclidean travelling salesman game
Recommended article: Cost allocation in shortest path games
Recommended article: Fair cost allocations under conflicts - a game-theoretic point of view -
Recommended article: Algorithms and Computation
description: scientific article; zbMATH DE number 1140247