Very Large-Scale Neighborhood Search for the Quadratic Assignment Problem

DOI10.1287/IJOC.1060.0201zbMath1241.90068OpenAlexW2153137830MaRDI QIDQ2892376

James B. Orlin, Ravindra K. Ahuja, Krishna C. Jha, Dushyant Sharma

Publication date: 18 June 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/1801

zbMATH Keywords

heuristicscombinatorial optimizationquadratic assignment problemneighborhood searchcomputational testing

Mathematics Subject Classification ID

Quadratic programming (90C20) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (8)

A New Neighborhood for the QAP ⋮ Cyclic transfers in school timetabling ⋮ An implementation of the iterated tabu search algorithm for the quadratic assignment problem ⋮ An experimental study of variable depth search algorithms for the quadratic assignment problem ⋮ Ejection chain and filter-and-fan methods in combinatorial optimization ⋮ Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem ⋮ An ejection chain algorithm for the quadratic assignment problem ⋮ Four-point conditions for the TSP: the complete complexity classification

Uses Software

• GRASP_QAP
• Unnamed Item

This page was built for publication: Very Large-Scale Neighborhood Search for the Quadratic Assignment Problem