Solving the Hamiltonian cycle problem via an artificial neural network
DOI10.1016/S0020-0190(00)00116-2zbMATH Open1339.68230OpenAlexW1966440163WikidataQ127229917 ScholiaQ127229917MaRDI QIDQ294834FDOQ294834
Authors: T. Tambouratzis 
Publication date: 16 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019000001162?np=y
Recommendations
- scientific article; zbMATH DE number 1784942
- Construction of Hamiltonian cycles by recurrent neural networks in graphs of distributed computer systems
- Neural networks and graph theory
- Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches
- scientific article; zbMATH DE number 1110519
artificial neural networkscombinatorial optimizationgraph theoryHamiltonian cycleparallel algorithmsharmony theorymaximal constraint satisfaction
Cites Work
Cited In (7)
- Elimination of negative circuits in certain neural network structures to achieve stable solutions
- Neural networks and graph theory
- Construction of Hamiltonian cycles by recurrent neural networks in graphs of distributed computer systems
- Hyperneural network-an efficient model for test generation in digital circuits
- Title not available (Why is that?)
- Title not available (Why is that?)
- Developing a new approach for (biological) optimal control problems: application to optimization of laccase production with a comparison between response surface methodology and novel geometric procedure
This page was built for publication: Solving the Hamiltonian cycle problem via an artificial neural network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294834)
