scientific article; zbMATH DE number 1508175

MaRDI QIDQ4506201zbMATH OpenFDO

Authors Alfonsas Misevičius

Publication date 21 November 2001

zbMATH Keywords

heuristicsintensive searchquadratic assignment problem

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• A new heuristic for the quadratic assignment problem
• A heuristic method for the quadratic assignment problem
• A tabu search algorithm for the quadratic assignment problem
• scientific article; zbMATH DE number 1203226
• Comparison of iterative searches for the quadratic assignment problem

Cited in

(6)

• Extensions of a tabu search adaptation to the quadratic assignment problem
• FaSa: A fast and stable quadratic placement algorithm
• Breakout local search for the quadratic assignment problem
• Very large-scale neighborhood search for the quadratic assignment problem
• Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem
• A survey for the quadratic assignment problem

Describes a project that uses

Uses Software

• QAPLIB

This page was built for publication:

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