TSP-SOLVER - A programming package for the traveling salesman problem. We report on the implementation of a programming package, called TSP- SOLVER, for the traveling salesman problem (TSP). Various variants of TSP can be treated by TSP-SOLVER: both symmetric and asymmetric cases, one- or multiple-TSP, one or first k best solutions, bandwidth limited distance matrix and other special cases, algorithms and heuristics. The system is user-friendly and offers the user, among other things, some possibilities to intervene during the solution a problem.