A connectionist approach to the quadratic assignment problem

DOI10.1016/0305-0548(92)90050-FzbMath0757.90060MaRDI QIDQ1200824

Jaishankar Chakrapani, Jadranka Skorin-Kapov

Publication date: 16 January 1993

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

simulated annealingtabu searchquadratic assignmentBoltzmann machines

Mathematics Subject Classification ID

Quadratic programming (90C20) Combinatorial optimization (90C27) Parallel numerical computation (65Y05) Boolean programming (90C09) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (8)

Massively parallel tabu search for the quadratic assignment problem ⋮ Optimization by ghost image processes in neural networks ⋮ Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements ⋮ Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements ⋮ Metaheuristics: A bibliography ⋮ Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem ⋮ A hybrid metaheuristic for the quadratic assignment problem ⋮ Massively parallel analog tabu search using neural networks applied to simple plant location problems

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• Quadratic assignment problems
• Some order dimension bounds for communication complexity problems
• ``Neural computation of decisions in optimization problems
• On the stability of the travelling salesman problem algorithm of Hopfield and Tank
• Boltzmann machines for travelling salesman problems
• The Backboard Wiring Problem: A Placement Algorithm
• Tabu Search—Part I
• Tabu Search—Part II
• Tabu Search Applied to the Quadratic Assignment Problem

This page was built for publication: A connectionist approach to the quadratic assignment problem