Effective formulation reductions for the quadratic assignment problem
From MaRDI portal
Publication:976022
DOI10.1016/j.cor.2010.02.001zbMath1188.90146OpenAlexW2100855450MaRDI QIDQ976022
Huizhen Zhang, Cesar Beltran-Royo, Miguel Fragoso 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
Related Items (7)
A methodology to exploit profit allocation in logistics joint distribution network optimization ⋮ Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers ⋮ Integrated Facility Layout Design and Flow Assignment Problem Under Uncertainty ⋮ Modeling and simulation for microscopic traffic flow based on multiple headway, velocity and acceleration difference ⋮ An experimental study of variable depth search algorithms for the quadratic assignment problem ⋮ New linearizations of quadratic assignment problems ⋮ Using constraint programming for the design of network-on-chip architectures
Uses Software
Cites Work
- An improved annealing scheme for the QAP
- The quadratic assignment problem in the context of the printed circuit board assembly process
- A survey for the quadratic assignment problem
- A branch-and-cut algorithm for quadratic assignment problems based on linearizations
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
- A parallel depth first search branch and bound algorithm for the quadratic assignment problem
- On the quadratic assignment problem
- An algorithm for the quadratic assignment problem using Benders' decomposition
- A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method
- Lower bounds for the quadratic assignment problem
- Location, scheduling, design and integer programming
- QAPLIB - a quadratic assignment problem library
- The quadratic assignment problem. Theory and algorithms
- Semidefinite programming relaxations for the quadratic assignment problem
- Recent advances in the solution of quadratic assignment problems
- Using quadratic assignment methods to generate initial permutations for least-squares unidimensional scaling of symmetric proximity matrices.
- A greedy genetic algorithm for the quadratic assignment problem
- Solving large quadratic assignment problems on computational grids
- Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem
- Solving quadratic assignment problems using convex quadratic programming relaxations
- The Quadratic Assignment Problem
- Ant colonies for the quadratic assignment problem
- Assignment Problems and the Location of Economic Activities
- A New Lower Bound Via Projection for the Quadratic Assignment Problem
- Scheduling Parallel Production Lines with Changeover Costs: Practical Application of a Quadratic Assignment/LP Approach
- P-Complete Approximation Problems
- Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming
- Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
- The QAP-polytope and the star transformation
- Box-inequalities for quadratic assignment polytopes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Effective formulation reductions for the quadratic assignment problem
