A survey on algorithmic approaches for solving tourist trip design problems

Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints

Marius M. Solomon · Operations Research · 1987 · 4.1K citations

Mathematical Programming, Engineering, Time Window Constraints +16

TSPLIB—A Traveling Salesman Problem Library

Gerhard Reinelt · INFORMS Journal on Computing · 1991 · 2.5K citations

Mathematical Programming, Test Problems, Salesman Problem Library +15

Relationships between nondeterministic and deterministic tape complexities

Walter J. Savitch · Journal of Computer and System Sciences · 1970 · 1.4K citations

Deterministic System, Engineering, Entropy +6

Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems

Sanjeev Arora · Journal of the ACM · 1998 · 1.1K citations · Full text

Engineering, Fixed Dimensions, Computational Complexity +20

A probabilistic heuristic for a computationally difficult set covering problem

Thomas A. Feo, Maurício G. C. Resende · Operations Research Letters · 1989 · 1K citations

Covering Problems, Engineering, Heuristic (Computer Science) +11