IMPROVED PROJECTION HOPFIELD NETWORK FOR THE QUADRATIC ASSIGNMENT PROBLEM

DOI10.1142/S0219622008002818zbMATH Open1152.90506MaRDI QIDQ3528981FDOQ3528981

Authors: Keiji Tatsumi, Tetsuzo Tanino 

Publication date: 17 October 2008

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

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

• A continuous Hopfield network equilibrium points algorithm
• A comprehensive survey of the reviewer assignment problem
• Title not available (Why is that?)
• ASSIGNMENT QUERY AND ITS IMPLEMENTATION IN MOVING OBJECT DATABASES
• 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

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)