IMPROVED PROJECTION HOPFIELD NETWORK FOR THE QUADRATIC ASSIGNMENT PROBLEM

DOI10.1142/S0219622008002818MaRDI QIDQ3528981zbMATH OpenFDO

Authors Keiji Tatsumi, Tetsuzo Tanino

Publication date 17 October 2008

Published in International Journal of Information Technology & Decision Making (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0219622008002818

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Discrete location and assignment (90B80) Neural networks for/in biological studies, artificial life and related topics (92B20)

Recommendations

• scientific article; zbMATH DE number 1727370
• A continuous Hopfield network equilibrium points algorithm
• The graph coloring problem: A neuronal network approach
• Improving the Hopfield model performance when applied to the traveling salesman problem. A divide-and-conquer scheme
• scientific article; zbMATH DE number 1357957

Cites work

• Assignment Problems and the Location of Economic Activities
• QAPLIB - a quadratic assignment problem library

Cited in

(6)

• Improving the Hopfield model performance when applied to the traveling salesman problem. A divide-and-conquer scheme
• A continuous Hopfield network equilibrium points algorithm
• ASSIGNMENT QUERY AND ITS IMPLEMENTATION IN MOVING OBJECT DATABASES
• A comprehensive survey of the reviewer assignment problem
• scientific article; zbMATH DE number 1357957 (Why is no real title available?)
• The graph coloring problem: A neuronal network approach

Describes a project that uses

Uses Software

• QAPLIB

This page was built for publication: IMPROVED PROJECTION HOPFIELD NETWORK FOR THE QUADRATIC ASSIGNMENT PROBLEM

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