New parallel randomized algorithms for the traveling salesman problem
From MaRDI portal
Publication:1302601
DOI10.1016/S0305-0548(98)00068-9zbMath0940.90063OpenAlexW2039604983MaRDI QIDQ1302601
Ning Sun, Sigurdur Ólafsson, Shi, Leyuan
Publication date: 25 July 2000
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(98)00068-9
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Operations research and management science (90B99)
Related Items (5)
Solving large batches of traveling salesman problems with parallel and distributed computing ⋮ Application of the cross-entropy method to the buffer allocation problem in a simulation-based environment ⋮ An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging ⋮ A hybrid of nested partition, binary ant system, and linear programming for the multidimensional knapsack problem ⋮ Simulation Optimization for MRO Systems Operations
This page was built for publication: New parallel randomized algorithms for the traveling salesman problem
