Gilmore-Lawler bound of quadratic assignment problem
From MaRDI portal
Recommendations
- Improved Gilmore-Lawler bound for quadratic assignment problems
- Lower bounds for the quadratic assignment problem
- Lower bounds based on linear programming for the quadratic assignment problem
- Strengthening Gilmore's bound for the quadratic assignment problem
- A generalized Gilmore-Lawler procedure for the quadratic assignment problem
Cites work
- A new exact algorithm for the solution of quadratic assignment problems
- A new linearization method for quadratic assignment problems
- A survey for the quadratic assignment problem
- Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
- Assignment Problems and the Location of Economic Activities
- Generating quadratic assignment test problems with known optimal permutations
- scientific article; zbMATH DE number 4199950 (Why is no real title available?)
- scientific article; zbMATH DE number 1302195 (Why is no real title available?)
- scientific article; zbMATH DE number 714526 (Why is no real title available?)
- scientific article; zbMATH DE number 3073200 (Why is no real title available?)
- Implementation of a Variance Reduction-Based Lower Bound in a Branch-and-Bound Algorithm for the Quadratic Assignment Problem
- Improved Gilmore-Lawler bound for quadratic assignment problems
- Lower bounds for the quadratic assignment problem
- Nonlinear assignment problems. Algorithms and applications
- Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
- P-Complete Approximation Problems
- Recent advances in the solution of quadratic assignment problems
- Solving large quadratic assignment problems in parallel
- Solving large-scale QAP problems in parallel with the serach library ZRAM
- The quadratic assignment problem
- The quadratic assignment problem. Theory and algorithms
This page was built for publication: Gilmore-Lawler bound of quadratic assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6059115)