Effective formulation reductions for the quadratic assignment problem
From MaRDI portal
Publication:976022
Recommendations
Cites work
- scientific article; zbMATH DE number 714526 (Why is no real title available?)
- scientific article; zbMATH DE number 714527 (Why is no real title available?)
- scientific article; zbMATH DE number 714537 (Why is no real title available?)
- scientific article; zbMATH DE number 1894379 (Why is no real title available?)
- scientific article; zbMATH DE number 2112207 (Why is no real title available?)
- scientific article; zbMATH DE number 970341 (Why is no real title available?)
- 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
- A branch-and-cut algorithm for quadratic assignment problems based on linearizations
- A greedy genetic algorithm for the quadratic assignment problem
- 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
- A survey for the quadratic assignment problem
- An algorithm for the quadratic assignment problem using Benders' decomposition
- An improved annealing scheme for the QAP
- Ant colonies for the quadratic assignment problem
- Assignment Problems and the Location of Economic Activities
- Box-inequalities for quadratic assignment polytopes
- Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming
- Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem
- Improved Gilmore-Lawler bound for quadratic assignment problems
- Location, scheduling, design and integer programming
- Lower bounds for the quadratic assignment problem
- On the quadratic assignment problem
- Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
- P-Complete Approximation Problems
- QAPLIB - a quadratic assignment problem library
- Recent advances in the solution of quadratic assignment problems
- Scheduling Parallel Production Lines with Changeover Costs: Practical Application of a Quadratic Assignment/LP Approach
- Semidefinite programming relaxations for the quadratic assignment problem
- Solving large quadratic assignment problems on computational grids
- Solving quadratic assignment problems using convex quadratic programming relaxations
- The QAP-polytope and the star transformation
- The quadratic assignment problem
- The quadratic assignment problem in the context of the printed circuit board assembly process
- The quadratic assignment problem. Theory and algorithms
- Using quadratic assignment methods to generate initial permutations for least-squares unidimensional scaling of symmetric proximity matrices.
Cited in
(9)- 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
- New linearizations of quadratic assignment problems
- Improved discrete reformulations for the quadratic assignment problem
- 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
- A methodology to exploit profit allocation in logistics joint distribution network optimization
- Using constraint programming for the design of network-on-chip architectures
- Best reduction of the quadratic semi-assignment problem
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)
