Solving optimisation problems using neucomp-a neural network compiler

DOI10.1080/00207169608804522zbMath1001.68505OpenAlexW1998564460WikidataQ123197617 ScholiaQ123197617MaRDI QIDQ2710797

No author found.

Publication date: 19 December 2002

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: http://psasir.upm.edu.my/id/eprint/42380/1/Solving%20optimisation%20problems%20using%20NEUCOMP%20-%20a%20neural%20network%20compiler.pdf

zbMATH Keywords

traveling salesman problemneural network modelsa general-purpose simulation toolaequent balance 8000continuous HopfieldNEUCOMPneural network compilerPotts-Glass models

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Theory of compilers and interpreters (68N20)

Related Items (1)

New runge kutta starters for multistep methods

Uses Software

• YACC
• Unnamed Item

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• On the stability of the travelling salesman problem algorithm of Hopfield and Tank
• Neucomp—a neural network compiler

This page was built for publication: Solving optimisation problems using neucomp-a neural network compiler