Effective formulation reductions for the quadratic assignment problem

DOI10.1016/J.COR.2010.02.001zbMATH Open1188.90146OpenAlexW2100855450MaRDI QIDQ976022FDOQ976022

Huizhen Zhang, C. Beltran-Royo, Miguel Constantino

Publication date: 11 June 2010

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10115/5815

zbMATH Keywords

sparse matrixquadratic assignment problemlinear programming relaxationlinear integer programming

Mathematics Subject Classification ID

Linear programming (90C05) Integer programming (90C10) Discrete location and assignment (90B80)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• QAPLIB - a quadratic assignment problem library
• Ant colonies for the quadratic assignment problem
• The quadratic assignment problem. Theory and algorithms
• Assignment Problems and the Location of Economic Activities
• A branch-and-cut algorithm for quadratic assignment problems based on linearizations
• P-Complete Approximation Problems
• The quadratic assignment problem in the context of the printed circuit board assembly process
• A survey for the quadratic assignment problem
• On the quadratic assignment problem
• Semidefinite programming relaxations for the quadratic assignment problem
• A level-2 reformulation-linearization technique bound for the quadratic assignment problem
• Recent advances in the solution of quadratic assignment problems
• The quadratic assignment problem
• Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
• Using quadratic assignment methods to generate initial permutations for least-squares unidimensional scaling of symmetric proximity matrices.
• Solving large quadratic assignment problems on computational grids
• Scheduling Parallel Production Lines with Changeover Costs: Practical Application of a Quadratic Assignment/LP Approach
• An improved annealing scheme for the QAP
• A parallel depth first search branch and bound algorithm for the quadratic assignment problem
• An algorithm for the quadratic assignment problem using Benders' decomposition
• A greedy genetic algorithm for the quadratic assignment problem
• Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem
• Lower bounds for the quadratic assignment problem
• Solving quadratic assignment problems using convex quadratic programming relaxations
• A New Lower Bound Via Projection for the Quadratic Assignment Problem
• A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method
• Location, scheduling, design and integer programming
• The QAP-polytope and the star transformation
• Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming
• Box-inequalities for quadratic assignment polytopes

Cited In (8)

• Modeling and simulation for microscopic traffic flow based on multiple headway, velocity and acceleration difference
• New linearizations of quadratic assignment problems
• Best reduction of the quadratic semi-assignment problem
• Using constraint programming for the design of network-on-chip architectures
• Integrated Facility Layout Design and Flow Assignment Problem Under Uncertainty
• A methodology to exploit profit allocation in logistics joint distribution network optimization
• An experimental study of variable depth search algorithms for the quadratic assignment problem
• Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers

Uses Software

• QAPLIB
• ZRAM
• HAS-QAP

This page was built for publication: Effective formulation reductions for the quadratic assignment problem

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