Method to solve the travelling salesman problem using the inverse of diffusion process
From MaRDI portal
Publication:1596595
DOI10.1016/S0378-4371(01)00571-4zbMath0994.90117OpenAlexW2055174261MaRDI QIDQ1596595
Publication date: 2 May 2002
Published in: Physica A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0378-4371(01)00571-4
Related Items (2)
Numerical investigations of the heterotic phase in dirty and clean layers ⋮ Genetic algorithm for combinatorial path planning: the subtour problem
Cites Work
- Optimization by Simulated Annealing
- Application of the renormalization group to deterministic global minimization of molecular conformation energy functions
- Graph traversals, genes and matroids: An efficient case of the travelling salesman problem
- A parallel build-up algorithm for global energy minimizations of molecular clusters using effective energy simulated annealing
- Principles of brain functioning. A synergetic approach to brain activity, behavior and cognition
- Nonlinear optimization simplified by hypersurface deformation.
- Traveling Salesman Problem and Statistical Physics
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Fast Algorithms for Geometric Traveling Salesman Problems
- Pattern formation outside of equilibrium
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This page was built for publication: Method to solve the travelling salesman problem using the inverse of diffusion process
