Rainer E. Burkard, Vladimir G. Deineko, René van Dal, Jack A.A. van der Veen, Gerhard J. Woeginger  Home/Search
Context Related
| tugraz.ac.at/pub/papers/...sfb52.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: unlp.edu.ar/cetad/m...TSPBIB_home (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The Traveling Salesman Problem belongs to the most important and most investigated problems in combinatorial optimization. Although it is an NP-hard problem, many of its special cases can be solved efficiently. We survey these special cases with emphasis on results obtained during the decade 1985--1995. This survey complements an earlier survey from 1985 compiled by Gilmore, Lawler and Shmoys. Keywords: Traveling Salesman Problem, Combinatorial optimization, Polynomial time algorithm,... (Update)
Similar documents based on text: More All
1.0: The Quadratic Assignment Problem with an.. - Burkard.. (1995) (Correct)
1.0: Weight Reduction Problems with Bottleneck Objective - Burkard, Lin, Zhang (2001) (Correct)
0.9: Finding All Essential Terms Of A Characteristic Maxpolynomial - Burkard, Butkovic (2002) (Correct)
BibTeX entry: (Update)
R.E. Burkard, V.G. Deineko, R. van Dal, J.A.A. van der Veen and G.J. Woeginger, Well-solvable special cases of the TSP: A survey, manuscript, Institute of Mathematics, University of Technology, Graz, Austria, 1995. http://citeseer.ist.psu.edu/burkard95wellsolvable.html More
@misc{ burkard95wellsolvable,
author = "R. Burkard and V. Deineko and R. van Dal and J. van der Veen and G. Woeginger",
title = "Well-solvable special cases of the TSP: A survey",
text = "R.E. Burkard, V.G. Deineko, R. van Dal, J.A.A. van der Veen and G.J. Woeginger,
Well-solvable special cases of the TSP: A survey, manuscript, Institute
of Mathematics, University of Technology, Graz, Austria, 1995.",
year = "1995",
url = "citeseer.ist.psu.edu/burkard95wellsolvable.html" }
Citations (may not include all citations):1254 Computational Geometry -- An Introduction (context) - Preparata, Shamos - 1985
951 Computational Complexity (context) - Papadimitriou - 1994
206 Rinehart and Winston (context) - Lawler, Optimization et al. - 1976
193 The Traveling Salesman Problem (context) - Lawler, Lenstra et al. - 1985
141 An effective heuristic algorithm for the traveling salesman .. (context) - Lin, Kernighan - 1973
120 Circulant matrices (context) - Davis - 1979
95 Complexity of machine scheduling problems (context) - Lenstra, Kan et al. - 1977
57 Geometric applications of a matrixsearching algorithm (context) - Aggarwal, Klawe et al. - 1987
27 Polyhedral computations (context) - Padberg, Grotschel
25 Circulants and their connectivities (context) - Boesch, Tindell - 1984
24 Perspectives of Monge Properties in Optimization - Burkard, Klinz et al.
21 Well-solved special cases (context) - Gilmore, Lawler et al.
20 On simple linear programming problems (context) - Hoffman - 1961
20 Sequence comparison with mixed convex and concave costs (context) - Eppstein - 1990
19 Sequencing a one state-variable machine: a solvable case of .. (context) - Gilmore, Gomory - 1964
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.ing.unlp.edu.ar/cetad/mos/TSPBIB_home.html): More
A Unified Approach to Simple Special Cases of.. - Burkard.. (1995) (Correct)
Three Easy Special Cases of the Euclidean Travelling.. - Deineko, Rudolf, van.. (1995) (Correct)
On the Spacefilling Curve Heuristic for the Euclidean.. - Bertsimas, Grigni (1988) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC