New parallel randomized algorithms for the traveling salesman problem
From MaRDI portal
Publication:1302601
DOI10.1016/S0305-0548(98)00068-9zbMath0940.90063MaRDI QIDQ1302601
Shi, Leyuan, Ning Sun, Sigurdur Ólafsson
Publication date: 25 July 2000
Published in: Computers \& Operations Research (Search for Journal in Brave)
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90B99: Operations research and management science
Related Items
A hybrid of nested partition, binary ant system, and linear programming for the multidimensional knapsack problem, An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging, Application of the cross-entropy method to the buffer allocation problem in a simulation-based environment