作者：Burkard, RE; Deineko, VG; Woeginger, GJ
作者单位：Graz University of Technology; University of Warwick
摘要：Let D = (d(ij)) be the n x n distance matrix of a set of n cities {1, 2,..., n}, and let T be a PQ-tree with node degree bounded by d that represents a set n(T) of permutations over {1, 2,..., n }. We show how to compute for D in O(2(d)n(3)) time the shortest travelling salesman tour contained in n(T). Our algorithm may be interpreted as a common generalization of the well-known Held and Karp dynamic programming algorithm for the TSP and of the dynamic programming algorithm for finding the sho...
作者：Facchinei, F
作者单位：Sapienza University Rome
摘要：We consider P-0 nonlinear complementarity problems and study the connectedness and stability of the solutions by applying degree theory and the Mountain Pass Theorem to a smooth reformulation of the complementarity problem. We show that the solution set is connected and bounded if a bounded isolated component of the solution set exists and that a solution is locally unique if and only if it is globally unique. Furthermore, we prove that a solution is stable in Ha's sense if and only if it is g...
