We discuss some classes of travelling salesman problems with sum and bottleneck objectiveswhich can be solved efficiently and pose the question how such special cases can lead to goodheuristics.
基金Partial support from "Austrian Science Foundation (Fonds zur Forderung der wissenschaftlichen Forschung), Projekt S 32/01 is gratefully acknowledged
文摘We discuss some classes of travelling salesman problems with sum and bottleneck objectiveswhich can be solved efficiently and pose the question how such special cases can lead to goodheuristics.
