An efficient continuation method for quadratic assignment problems

DOI10.1016/j.cor.2009.09.002zbMath1178.90220OpenAlexW2020025073MaRDI QIDQ2654391

Yong Xia

Publication date: 15 January 2010

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

Full work available at URL: https://doi.org/10.1016/j.cor.2009.09.002

zbMATH Keywords

quadratic assignment problemLagrangian smoothingheuristicFrank-Wolfe algorithmKKT

Mathematics Subject Classification ID

Continuous location (90B85) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (4)

Global optimization of a class of nonconvex quadratically constrained quadratic programming problems ⋮ Continuation methods for approximate large scale object sequencing ⋮ An experimental study of variable depth search algorithms for the quadratic assignment problem ⋮ $L_p$-norm Regularization Algorithms for Optimization Over Permutation Matrices

Uses Software

• QAPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey for the quadratic assignment problem
• QAPLIB - a quadratic assignment problem library
• The quadratic assignment problem. Theory and algorithms
• Recent advances in the solution of quadratic assignment problems
• A heuristic for quadratic Boolean programs with applications to quadratic assignment problems
• Solving large quadratic assignment problems on computational grids
• The Backboard Wiring Problem: A Placement Algorithm
• A New Lower Bound Via Projection for the Quadratic Assignment Problem

This page was built for publication: An efficient continuation method for quadratic assignment problems