Solving optimisation problems using neucomp-a neural network compiler

DOI10.1080/00207169608804522MaRDI QIDQ2710797zbMATH OpenOpenAlexWikidataFDO

Authors D. J. Evans

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)

Cites work

• scientific article; zbMATH DE number 107539 (Why is no real title available?)
• Neucomp—a neural network compiler
• On the stability of the travelling salesman problem algorithm of Hopfield and Tank
• Optimization by simulated annealing

Cited in

(1)

• New runge kutta starters for multistep methods

Describes a project that uses

Uses Software

• YACC
• Mathematica

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2710797)