Abstract
Traveling Salesman games are quite well-studied examples of socalled cooperative games. Formally, such games are defined as follows.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
U. Faigle, S. Fekete, W. Hochstâttler, W. Kern: “On approximately fair cost allocations in euclidean TSP-games”, working paper, University of Twente, 1993
U. Faigle, W. Kern (93): “On some approximately balanced combinatorial cooperative games”, ZOR (to appear)
M. Goemans, “Analysis of LP-relaxation for a class of connectivity problems” PHD thesis, MIT, Massachusetts, 1990
J. Potters, I. Curiel, S. Tijs: “Traveling Salesman games”, Math. Progr. 53 (1992), 199–211.
J.M. Steele, “Probabilistic and worst case analysis of classical problems of combinatorial optimization in euclidean space”, Mathematics of OR, 15 (4), 1990, 749–770.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Physica-Verlag Heidelberg
About this paper
Cite this paper
Faigle, U., Kern, W., Fekete, S., Hochstättler, W. (1994). Approximating the core of euclidean TSP games. In: Bachem, A., Derigs, U., Jünger, M., Schrader, R. (eds) Operations Research ’93. Physica, Heidelberg. https://doi.org/10.1007/978-3-642-46955-8_40
Download citation
DOI: https://doi.org/10.1007/978-3-642-46955-8_40
Publisher Name: Physica, Heidelberg
Print ISBN: 978-3-7908-0794-3
Online ISBN: 978-3-642-46955-8
eBook Packages: Springer Book Archive