Lower bounds for the quadratic assignment problem based upon a dual formulation
From MaRDI portal
Publication:2770106
DOI10.1287/OPRE.46.6.912zbMATH Open0979.90100OpenAlexW2150239570MaRDI QIDQ2770106FDOQ2770106
Authors: Thomas Grant, Peter M. Hahn 
Publication date: 7 February 2002
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/9a8a7c4fff7e5c5b44886046da2974f7e3e7ccac
Recommendations
- scientific article; zbMATH DE number 714527
- Lower bounds for the quadratic assignment problem via triangle decompositions
- A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method
- A dual framework for lower bounds of the quadratic assignment problem based on linearization
- A solution method for the quadratic assignment problem based on the Hungarian algorithm
Quadratic programming (90C20) Combinatorial optimization (90C27) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Cited In (36)
- RLT insights into lift-and-project closures
- A solution method for the quadratic assignment problem based on the Hungarian algorithm
- Title not available (Why is that?)
- Ranking scalar products to improve bounds for the quadratic assignment problem
- The linearization problem of a binary quadratic problem and its applications
- Selected topics on assignment problems
- An exact qubit allocation approach for NISQ architectures
- Title not available (Why is that?)
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
- A survey for the quadratic assignment problem
- A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method
- A dual framework for lower bounds of the quadratic assignment problem based on linearization
- The multi-story space assignment problem
- Matheuristics: survey and synthesis
- Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting
- Lower bounds based on linear programming for the quadratic assignment problem
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
- An algorithm for the generalized quadratic assignment problem
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique
- Lower bounding procedure for the asymmetric quadratic traveling salesman problem
- Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation
- Taking advantage of symmetry in some quadratic assignment problems
- Sinkhorn Algorithm for Lifted Assignment Problems
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- Title not available (Why is that?)
- A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
- Mapping the convergence of genetic algorithms
- Exact solution of emerging quadratic assignment problems
- The quadratic three-dimensional assignment problem: exact and approximate solution methods
- Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters
- Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers
- A generalized Gilmore-Lawler procedure for the quadratic assignment problem
- A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem
- A new relaxation framework for quadratic assignment problems based on matrix splitting
- A revised reformulation-linearization technique for the quadratic assignment problem
- Lower bounds for the quadratic assignment problem
Uses Software
This page was built for publication: Lower bounds for the quadratic assignment problem based upon a dual formulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2770106)
