Authors:
LIBURA M
VANDERPOORT ES
SIERKSMA C
VANDERVEEN JAA
Citation: M. Libura et al., STABILITY ASPECTS OF THE TRAVELING SALESMAN PROBLEM-BASED ON K-BEST SOLUTIONS, Discrete applied mathematics, 87(1-3), 1998, pp. 159-185
Citation: Jaa. Vanderveen et al., SEQUENCING JOBS THAT REQUIRE COMMON RESOURCES ON A SINGLE-MACHINE - ASOLVABLE CASE OF THE TSP, Mathematical programming, 82(1-2), 1998, pp. 235-254
Citation: Jaa. Vanderveen et Sh. Zhang, LOW-COMPLEXITY ALGORITHMS FOR SEQUENCING JOBS WITH A FIXED NUMBER OF JOB-CLASSES, Computers & operations research, 23(11), 1996, pp. 1059-1067
Citation: Jaa. Vanderveen, A NEW CLASS OF PYRAMIDALLY SOLVABLE SYMMETRICAL TRAVELING SALESMAN PROBLEMS, SIAM journal on discrete mathematics, 7(4), 1994, pp. 585-592
Citation: Jaa. Vanderveen, A NEW CLASS OF PYRAMIDALLY SOLVABLE SYMMETRICAL TRAVELING SALESMAN PROBLEMS, SIAM journal on discrete mathematics, 7(4), 1994, pp. 585-592
Citation: Jaa. Vanderveen, AN O(N) ALGORITHM TO SOLVE THE BOTTLENECK TRAVELING SALESMAN PROBLEM RESTRICTED TO ORDERED PRODUCT MATRICES, Discrete applied mathematics, 47(1), 1993, pp. 57-75
Citation: R. Vandal et al., SMALL AND LARGE TSP - 2 POLYNOMIALLY SOLVABLE CASES OF THE TRAVELING SALESMAN PROBLEM, European journal of operational research, 69(1), 1993, pp. 107-120