Ein branch and bound Algorithmus zur Lösung des Rundreiseproblems
By: von Bernd Jeromin.
Publisher: Technische Universität Dresden
Published: 1980
Place of publication: [Dresden]
Language: ger
Subjects: Traveling-salesman problem.; Branch and bound algorithms.
Notes: Bibliography: p. 8-9.
Cover title.