Parameter tuning of continuous Hopfield network applied to combinatorial optimization
From MaRDI portal
Publication:6496420
DOI10.1007/S10472-023-09895-6MaRDI QIDQ6496420
Unnamed Author, Unnamed Author, Unnamed Author
Publication date: 3 May 2024
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Cites Work
- Unnamed Item
- On approximating the memory-constrained module allocation problem
- Weight constraint programs with evaluable functions
- A discrete-time quantized-state Hopfield neural network
- The graph coloring problem: A neuronal network approach
- A review of Hopfield neural networks for solving mathematical programming problems
- ``Neural computation of decisions in optimization problems
- NP-complete scheduling problems
- Traditional heuristic versus Hopfield neural network approaches to a car sequencing problem
- The task allocation problem with constant communication.
- Neural networks in business: Techniques and applications for the operations researcher
- Using artificial neural networks to solve the orienteering problem
- Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters
- A continuous Hopfield network equilibrium points algorithm
- The generalized quadratic knapsack problem. A neuronal network approach
- TSPLIB—A Traveling Salesman Problem Library
- An efficient algorithm for a task allocation problem
- On parameter settings of Hopfield networks applied to traveling salesman problems
- Neural networks and physical systems with emergent collective computational abilities.
- An efficient multivalued Hopfield network for the traveling salesman problem
This page was built for publication: Parameter tuning of continuous Hopfield network applied to combinatorial optimization