Cvetković, Dragoš; Čangalović, Mirjana; Dimitrijević, Vladimir; Kraus, Laslo; Milosavljević, Milan; Simić, Slobodan TSP-SOLVER - A programming package for the traveling salesman problem. (English) Zbl 0722.90059 Publ. Elektroteh. Fak., Univ. Beogr., Ser. Mat. 1, 41-47 (1990). Summary: 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. MSC: 90C27 Combinatorial optimization 68R10 Graph theory (including graph drawing) in computer science 90-08 Computational methods for problems pertaining to operations research and mathematical programming 90C35 Programming involving graphs or networks Keywords:traveling salesman; heuristics Software:TSP-SOLVER PDFBibTeX XMLCite \textit{D. Cvetković} et al., Publ. Elektroteh. Fak., Univ. Beogr., Ser. Mat. 1, 41--47 (1990; Zbl 0722.90059)