Boltzmann machines for travelling salesman problems
From MaRDI portal
Publication:1119182
DOI10.1016/0377-2217(89)90355-XzbMath0669.90079OpenAlexW1993697459MaRDI QIDQ1119182
Jan H. M. Korst, Emile H. L. Aarts
Publication date: 1989
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(89)90355-x
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Boolean programming (90C09) Theory of operating systems (68N25)
Related Items (8)
Boltzmann machines as a model for parallel annealing ⋮ Metaheuristics: A bibliography ⋮ Evolutionary algorithms for solving multi-objective travelling salesman problem ⋮ FINITE SIZE SCALING AND CRITICAL TRANSITION IN CONSTRAINED TRAVELING SALESMAN PROBLEM ⋮ A connectionist approach to the quadratic assignment problem ⋮ Recurrent neural networks for linear programming: Analysis and design principles ⋮ Convergence rate of a simulated annealing algorithm with noisy observations ⋮ Massively parallel analog tabu search using neural networks applied to simple plant location problems
Cites Work
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- ``Neural computation of decisions in optimization problems
- Probabilistic exchange algorithms and Euclidean traveling salesman problems
- A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem.
- The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
- Using simulated annealing to solve routing and location problems
- Neural networks and physical systems with emergent collective computational abilities.
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This page was built for publication: Boltzmann machines for travelling salesman problems
