A Survey of some Non-Standard Traveling Salesman Problems
Yugoslav journal of operations research, Tome 2 (1992) no. 2, p. 163
Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
We present a survey of some non-standard travelling salesman problems
(TSP) with emphasis on authors' contributions. The results include complexity
indices and k-best solutions for the ordinary TSP, the TSP on a chained structure,
a multi-TSP on a bandwidth-limited digraph as well as the corresponding general
case, a generalized TSP as well as the description of some software for TSP.
Keywords:
operations research, combinatorial optimization, traveling salesman problem, branch and bound, dynamic programming, bandwidth limited graphs, multipartite graphs, complexity of algorithms, software.
@article{YJOR_1992_2_2_a2,
author = {Drago\v{s} Cvetkovi\'c and Vladimir Dimitrijevic and Milan Milosavljevic},
title = {A {Survey} of some {Non-Standard} {Traveling} {Salesman} {Problems}},
journal = {Yugoslav journal of operations research},
pages = {163 },
year = {1992},
volume = {2},
number = {2},
language = {en},
url = {http://geodesic.mathdoc.fr/item/YJOR_1992_2_2_a2/}
}
TY - JOUR AU - Dragoš Cvetković AU - Vladimir Dimitrijevic AU - Milan Milosavljevic TI - A Survey of some Non-Standard Traveling Salesman Problems JO - Yugoslav journal of operations research PY - 1992 SP - 163 VL - 2 IS - 2 UR - http://geodesic.mathdoc.fr/item/YJOR_1992_2_2_a2/ LA - en ID - YJOR_1992_2_2_a2 ER -
Dragoš Cvetković; Vladimir Dimitrijevic; Milan Milosavljevic. A Survey of some Non-Standard Traveling Salesman Problems. Yugoslav journal of operations research, Tome 2 (1992) no. 2, p. 163 . http://geodesic.mathdoc.fr/item/YJOR_1992_2_2_a2/