Lower bounds based on linear programming for the quadratic assignment problem

DOI10.1007/BF01302894zbMath0832.90091OpenAlexW2058156032MaRDI QIDQ1804578

Zvi Drezner

Publication date: 5 March 1996

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01302894

zbMATH Keywords

Gilmore-Lawler lower bound for the quadratic assignment problem

Mathematics Subject Classification ID

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

Related Items (4)

A survey for the quadratic assignment problem ⋮ Mapping the convergence of genetic algorithms ⋮ The QAP-polytope and the star transformation ⋮ Exact Solution of Two Location Problems via Branch-and-Bound

Uses Software

• AMPL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Modeling Language for Mathematical Programming
• Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem
• Lower bounds for the quadratic assignment problem
• The Quadratic Assignment Problem
• A New Lower Bound for the Quadratic Assignment Problem
• Tabu Search Applied to the Quadratic Assignment Problem
• A New Lower Bound Via Projection for the Quadratic Assignment Problem
• An Efficient Parity Checking Scheme for Random and Burst Errors
• Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem

This page was built for publication: Lower bounds based on linear programming for the quadratic assignment problem