@article{78fbed795fe04ff68f93c513d7a479b8,
title = "The Satellite List and New Data Structures for Symmetric Traveling Salesman Problems",
keywords = "satellite list, symmetric traveling salesman problem, new data structure, computational effort, salesman problem, k-level satellite tree representation, satellite list data structure, specialized 2-level tree structure, tour operation, data representation, general tour operation, influence algorithm design, subpath reversal, new data, doubly-linked list, k-level satellite tree, search algorithm, symmetric graph-based optimization problem, tsp tour",
author = "Colin Osterman and Cesar Rego and Keith Womer",
note = "CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): Abstract - The problem of data representation is fundamental to the efficiency of search algorithms for the traveling salesman problem (TSP). The computational effort required to perform such tour operations as traversal and subpath reversal considerably influence algorithm design and performance.",
year = "2004",
language = "American English",
journal = "CiteSeerX",
}