Lower bounds based on linear programming for the quadratic assignment problem
From MaRDI portal
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
- A Modeling Language for Mathematical Programming
- A New Lower Bound for 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
- Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem
- 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?)
- 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
(25)- On lower bounds for a class of quadratic 0,1 programs
- Strengthening Gilmore's bound for the quadratic assignment problem
- Lower bounds for the quadratic assignment problem
- A dual framework for lower bounds of the quadratic assignment problem based on linearization
- The quadratic cycle cover problem: special cases and efficient bounds
- Lower bound improvement and forcing rule for quadratic binary programming
- A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices
- Equivalence of some LP-based lower bounds for the Golomb ruler problem
- Approximating the minimum quadratic assignment problems
- Application of polynomial approximation hierarchy to quadratic assignment problem
- A New Lower Bound for the Quadratic Assignment Problem
- A New Lower Bound Via Projection for the Quadratic Assignment Problem
- scientific article; zbMATH DE number 714527 (Why is no real title available?)
- scientific article; zbMATH DE number 1795730 (Why is no real title available?)
- Dynamic programming and lower-bound approaches to the minimum binding problem
- Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming
- A generalized Gilmore-Lawler procedure for the quadratic assignment problem
- Improved Gilmore-Lawler bound for quadratic assignment problems
- Exact solution of two location problems via branch-and-bound
- scientific article; zbMATH DE number 970341 (Why is no real title available?)
- The QAP-polytope and the star transformation
- Gilmore-Lawler bound of quadratic assignment problem
- A survey for the quadratic assignment problem
- Bounds for the quadratic assignment problem using the bundle method
- Mapping the convergence of genetic algorithms
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)
