Application of the noising method to the travelling salesman problem
DOI10.1016/S0377-2217(99)00457-9zbMATH Open0952.90035OpenAlexW2169275881MaRDI QIDQ1580974FDOQ1580974
Publication date: 14 September 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00457-9
Recommendations
simulated annealingcombinatorial optimizationmetaheuristicstravelling salesman problemnoising method
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- TSPLIB—A Traveling Salesman Problem Library
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The noising methods: A generalization of some metaheuristics
- Title not available (Why is that?)
- Computer Solutions of the Traveling Salesman Problem
- Title not available (Why is that?)
- The noising method: A new method for combinatorial optimization
- The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
Cited In (8)
- Application of the “descent with mutations” metaheuristic to a clique partitioning problem
- Automatic clustering using genetic algorithms
- The noising methods: A survey
- Self-tuning of the noising methods
- The noising method: A new method for combinatorial optimization
- The noising methods: A generalization of some metaheuristics
- A tabu search approach for the minimum sum-of-squares clustering problem
- Noising methods for a clique partitioning problem
Uses Software
This page was built for publication: Application of the noising method to the travelling salesman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1580974)
