Effective formulation reductions for the quadratic assignment problem
type: Item
instance of: scholarly article
title: Effective formulation reductions for the quadratic assignment problem
zbMATH Open document ID: 1188.90146
author: Huizhen Zhang
author: C. Beltran-Royo
author: Miguel Constantino
published in: Computers \& Operations Research
publication date: 2010-06-11T00:00:00Z
full work available at URL: http://hdl.handle.net/10115/5815
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 5720299
zbMATH Keywords: quadratic assignment problem
zbMATH Keywords: linear integer programming
zbMATH Keywords: linear programming relaxation
zbMATH Keywords: sparse matrix
describes a project that uses: ZRAM
describes a project that uses: HAS-QAP
describes a project that uses: QAPLIB
MaRDI profile type: Publication
OpenAlex ID: W2100855450
cites work: A level-2 reformulation-linearization technique bound for the quadratic assignment problem
cites work: Q4321548
cites work: A greedy genetic algorithm for the quadratic assignment problem
cites work: Solving large quadratic assignment problems on computational grids
cites work: Recent advances in the solution of quadratic assignment problems
cites work: Solving quadratic assignment problems using convex quadratic programming relaxations
cites work: Using quadratic assignment methods to generate initial permutations for least-squares unidimensional scaling of symmetric proximity matrices.
cites work: QAPLIB - a quadratic assignment problem library
cites work: The quadratic assignment problem. Theory and algorithms
cites work: An improved annealing scheme for the QAP
cites work: Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem
cites work: The quadratic assignment problem in the context of the printed circuit board assembly process
cites work: A branch-and-cut algorithm for quadratic assignment problems based on linearizations
cites work: On the quadratic assignment problem
cites work: Ant colonies for the quadratic assignment problem
cites work: Scheduling Parallel Production Lines with Changeover Costs: Practical Application of a Quadratic Assignment/LP Approach
cites work: Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
cites work: A New Lower Bound Via Projection for the Quadratic Assignment Problem
cites work: A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method
cites work: An algorithm for the quadratic assignment problem using Benders' decomposition
cites work: Assignment Problems and the Location of Economic Activities
cites work: The quadratic assignment problem
cites work: Lower bounds for the quadratic assignment problem
cites work: Q4321558
cites work: A survey for the quadratic assignment problem
cites work: A parallel depth first search branch and bound algorithm for the quadratic assignment problem
cites work: Q4823664
cites work: Box-inequalities for quadratic assignment polytopes
cites work: The QAP-polytope and the star transformation
cites work: Location, scheduling, design and integer programming
cites work: Q4321546
cites work: Q5688490
cites work: Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming
cites work: P-Complete Approximation Problems
cites work: Q4801578
cites work: Q5432876
cites work: Semidefinite programming relaxations for the quadratic assignment problem
DOI: 10.1016/J.COR.2010.02.001
description: scientific article; zbMATH DE number 5720299