New parallel randomized algorithms for the traveling salesman problem
From MaRDI portal
Recommendations
- SOLVING THE TRAVELING SALESMAN PROBLEM USING EFFICIENT RANDOMIZED PARALLEL APPROXIMATION ALGORITHMS
- scientific article; zbMATH DE number 1225029
- scientific article; zbMATH DE number 4093206
- scientific article; zbMATH DE number 764414
- Solving large batches of traveling salesman problems with parallel and distributed computing
- scientific article; zbMATH DE number 4131978
- PARALLEL TEMPERING FOR THE TRAVELING SALESMAN PROBLEM
- scientific article; zbMATH DE number 1304530
Cited in
(10)- Simulation optimization for mro systems operations
- Application of the cross-entropy method to the buffer allocation problem in a simulation-based environment
- Randomized gravitational emulation search algorithm for symmetric traveling salesman problem
- An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging
- Hybrid nested partitions method for the traveling salesman problem
- A hybrid of nested partition, binary ant system, and linear programming for the multidimensional knapsack problem
- Solving large batches of traveling salesman problems with parallel and distributed computing
- The parallel complexity of TSP heuristics
- PARALLEL TEMPERING FOR THE TRAVELING SALESMAN PROBLEM
- scientific article; zbMATH DE number 4093206 (Why is no real title available?)
This page was built for publication: New parallel randomized algorithms for the traveling salesman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1302601)