Method to solve the travelling salesman problem using the inverse of diffusion process
From MaRDI portal
(Redirected from Publication:1596595)
Recommendations
- scientific article; zbMATH DE number 3882227
- A method for solving traveling-salesman problems
- On inverse traveling salesman problems
- Some Inverse Traveling Salesman Problems
- scientific article; zbMATH DE number 238296
- On the solution of traveling salesman problems
- A new approach to solve the traveling salesman problem
- Method of scaling in approximate solution of the traveling salesman problem
- Solution of a large-scale traveling-salesman problem
Cites work
- A parallel build-up algorithm for global energy minimizations of molecular clusters using effective energy simulated annealing
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Application of the renormalization group to deterministic global minimization of molecular conformation energy functions
- Fast Algorithms for Geometric Traveling Salesman Problems
- Graph traversals, genes and matroids: An efficient case of the travelling salesman problem
- Nonlinear optimization simplified by hypersurface deformation.
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Optimization by simulated annealing
- Pattern formation outside of equilibrium
- Principles of brain functioning. A synergetic approach to brain activity, behavior and cognition
- Traveling Salesman Problem and Statistical Physics
Cited in
(2)
This page was built for publication: Method to solve the travelling salesman problem using the inverse of diffusion process
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1596595)
