Heuristics for biquadratic assignment problems and their computational comparison

DOI10.1016/0377-2217(95)00007-DzbMath0904.90138MaRDI QIDQ1388822

Eranda Çela, Rainer E. Burkard

Publication date: 11 June 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

heuristicssimulated annealingtabu searchbiquadratic assignment

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Boolean programming (90C09)

Related Items

BRANCHING TECHNIQUE FOR A BI-OBJECTIVE TWO-STAGE ASSIGNMENT PROBLEM, A survey for the quadratic assignment problem, Metaheuristics: A bibliography, On New Classes of Nonnegative Symmetric Tensors, Exact solution of emerging quadratic assignment problems, Maximizing Polynomials Subject to Assignment Constraints, Random assignment problems, On cones of nonnegative quartic forms, Selected topics on assignment problems, A performance guarantee heuristic for electronic components placement problems including thermal effects, Single- and multi-objective facility layout with workflow interference considerations, Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search, A GRASP for the biquadratic assignment problem

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• Using tabu search techniques for graph coloring
• An improved annealing scheme for the QAP
• A thermodynamically motivated simulation procedure for combinatorial optimization problems
• A Monte Carlo simulated annealing approach to optimization over continuous variables
• Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem
• The asymptotic behaviour of quadratic sum assignment problems: A statistical mechanics approach
• A user's guide to tabu search
• Tabu Search—Part I
• Tabu Search—Part II
• Tabu Search Applied to the Quadratic Assignment Problem
• Equation of State Calculations by Fast Computing Machines