Lower bounds based on linear programming for the quadratic assignment problem

DOI10.1007/BF01302894MaRDI QIDQ1804578zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Lower bounds for the quadratic assignment problem
• scientific article; zbMATH DE number 714527
• A new lower bound for the quadratic assignment problem
• A New Lower Bound for the Quadratic Assignment Problem
• A dual framework for lower bounds of the quadratic assignment problem based on linearization
• Lower bounds for the quadratic assignment problem based upon a dual formulation
• Lower bounds for the quadratic semi-assignment problem
• Improved lower bounds for the quadratic assignment problem
• scientific article; zbMATH DE number 4143776
• scientific article; zbMATH DE number 970341

Cites work

• scientific article; zbMATH DE number 4199950 (Why is no real title available?)
• scientific article; zbMATH DE number 1203226 (Why is no real title available?)
• scientific article; zbMATH DE number 724213 (Why is no real title available?)
• A Modeling Language for Mathematical Programming
• A New Lower Bound Via Projection for the Quadratic Assignment Problem
• A New Lower Bound for the Quadratic Assignment Problem
• An Efficient Parity Checking Scheme for Random and Burst Errors
• Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem
• Lower bounds for the quadratic assignment problem
• Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
• Tabu Search Applied to the Quadratic Assignment Problem
• The quadratic assignment problem

Cited in

(23)

• A dual framework for lower bounds of the quadratic assignment problem based on linearization
• Application of polynomial approximation hierarchy to quadratic assignment problem
• scientific article; zbMATH DE number 714527 (Why is no real title available?)
• Improved Gilmore-Lawler bound for quadratic assignment problems
• A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices
• Exact solution of two location problems via branch-and-bound
• Approximating the minimum quadratic assignment problems
• On lower bounds for a class of quadratic 0,1 programs
• A New Lower Bound Via Projection for the Quadratic Assignment Problem
• The QAP-polytope and the star transformation
• Lower bound improvement and forcing rule for quadratic binary programming
• A survey for the quadratic assignment problem
• Lower bounds for the quadratic assignment problem
• Bounds for the quadratic assignment problem using the bundle method
• Gilmore-Lawler bound of quadratic assignment problem
• The quadratic cycle cover problem: special cases and efficient bounds
• Equivalence of some LP-based lower bounds for the Golomb ruler problem
• Mapping the convergence of genetic algorithms
• A New Lower Bound for the Quadratic Assignment Problem
• scientific article; zbMATH DE number 1795730 (Why is no real title available?)
• A generalized Gilmore-Lawler procedure for the quadratic assignment problem
• scientific article; zbMATH DE number 970341 (Why is no real title available?)
• Dynamic programming and lower-bound approaches to the minimum binding problem

Describes a project that uses

Uses Software

• AMPL

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

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