A survey for the quadratic assignment problem
From MaRDI portal
Publication:852928
Recommendations
- scientific article; zbMATH DE number 714526
- A contribution to quadratic assignment problems
- The quadratic assignment problem. Theory and algorithms
- Recent approaches to the quadratic assignment problem
- An algorithm for quadratic assignment problems
- A new form of the quadratic assignment problem and approximate solutions
- Recent advances in the solution of quadratic assignment problems
- An Algorithm for the Quadratic Assignment Problem
Cites work
- scientific article; zbMATH DE number 3643044 (Why is no real title available?)
- scientific article; zbMATH DE number 3644805 (Why is no real title available?)
- scientific article; zbMATH DE number 4199950 (Why is no real title available?)
- scientific article; zbMATH DE number 3828715 (Why is no real title available?)
- scientific article; zbMATH DE number 3982880 (Why is no real title available?)
- scientific article; zbMATH DE number 4022343 (Why is no real title available?)
- scientific article; zbMATH DE number 4112411 (Why is no real title available?)
- scientific article; zbMATH DE number 1187168 (Why is no real title available?)
- scientific article; zbMATH DE number 3685223 (Why is no real title available?)
- scientific article; zbMATH DE number 3759934 (Why is no real title available?)
- scientific article; zbMATH DE number 43238 (Why is no real title available?)
- scientific article; zbMATH DE number 151870 (Why is no real title available?)
- scientific article; zbMATH DE number 3486933 (Why is no real title available?)
- scientific article; zbMATH DE number 3635827 (Why is no real title available?)
- scientific article; zbMATH DE number 1203289 (Why is no real title available?)
- scientific article; zbMATH DE number 1281677 (Why is no real title available?)
- scientific article; zbMATH DE number 1302175 (Why is no real title available?)
- scientific article; zbMATH DE number 1302195 (Why is no real title available?)
- scientific article; zbMATH DE number 635066 (Why is no real title available?)
- 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 714529 (Why is no real title available?)
- scientific article; zbMATH DE number 714530 (Why is no real title available?)
- scientific article; zbMATH DE number 714531 (Why is no real title available?)
- scientific article; zbMATH DE number 714532 (Why is no real title available?)
- scientific article; zbMATH DE number 714533 (Why is no real title available?)
- scientific article; zbMATH DE number 714534 (Why is no real title available?)
- scientific article; zbMATH DE number 714535 (Why is no real title available?)
- scientific article; zbMATH DE number 714537 (Why is no real title available?)
- scientific article; zbMATH DE number 714538 (Why is no real title available?)
- scientific article; zbMATH DE number 714539 (Why is no real title available?)
- scientific article; zbMATH DE number 736969 (Why is no real title available?)
- scientific article; zbMATH DE number 1131473 (Why is no real title available?)
- scientific article; zbMATH DE number 1975087 (Why is no real title available?)
- scientific article; zbMATH DE number 2013511 (Why is no real title available?)
- scientific article; zbMATH DE number 2049005 (Why is no real title available?)
- scientific article; zbMATH DE number 1508175 (Why is no real title available?)
- scientific article; zbMATH DE number 1545695 (Why is no real title available?)
- scientific article; zbMATH DE number 1795730 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- scientific article; zbMATH DE number 1569485 (Why is no real title available?)
- scientific article; zbMATH DE number 1843033 (Why is no real title available?)
- scientific article; zbMATH DE number 1894380 (Why is no real title available?)
- scientific article; zbMATH DE number 2096819 (Why is no real title available?)
- scientific article; zbMATH DE number 2112207 (Why is no real title available?)
- scientific article; zbMATH DE number 776090 (Why is no real title available?)
- scientific article; zbMATH DE number 232498 (Why is no real title available?)
- scientific article; zbMATH DE number 2201174 (Why is no real title available?)
- scientific article; zbMATH DE number 3240945 (Why is no real title available?)
- scientific article; zbMATH DE number 960162 (Why is no real title available?)
- scientific article; zbMATH DE number 4187451 (Why is no real title available?)
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- A GRASP for the biquadratic assignment problem
- A Graph Theoretic Analysis of Bounds for the Quadratic Assignment Problem
- A Lagrangean Relaxation Approach for a Turbine Design Quadratic Assignment Problem
- A Lagrangian relaxation algorithm for sparse quadratic assignment problems
- A New Lower Bound Via Projection for the Quadratic Assignment Problem
- A New Lower Bound for the Quadratic Assignment Problem
- A Review of the Placement and Quadratic Assignment Problems
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- A bilinear programming formulation of the 3-dimensional assignment problem
- A branch and bound algorithm for the Koopmans-Beckmann quadratic assignment problem
- A branch and bound method for solving the bidirectional circular layout problem
- A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method
- A branch-and-bound-based heuristic for solving the quadratic assignment problem
- A classification of formulations for the (time-dependent) traveling salesman problem
- A deterministic annnealing algorithm for a combinatorial optimization problem using replicator equations
- A divide-and-conquer local search heuristic for data visualization
- A dual framework for lower bounds of the quadratic assignment problem based on linearization
- A genetic approach to the quadratic assignment problem
- A greedy genetic algorithm for the quadratic assignment problem
- A heuristic for quadratic Boolean programs with applications to quadratic assignment problems
- A hybrid approach for concurrent layout design of cells and their flow paths in a tree configuration
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
- A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem
- A modification of threshold accepting and its application to the quadratic assignment problem
- A neural network approach to facility layout problems
- A new Lagrangian relaxation based algorithm for a class of multidimensional assignment problems
- A new bound for the quadratic assignment problem based on convex quadratic programming
- A new exact algorithm for the solution of quadratic assignment problems
- A new formulation of the quadratic assignment problem on r-dimensional grid
- A new genetic algorithm for the quadratic assignment problem
- A new rounding procedure for the assignment problem with applications to dense graph arrangement problems
- A novel chaotic search for quadratic assignment problems
- A parallel adaptive tabu search approach
- A parallel branch and bound algorithm for the quadratic assignment problem
- A parallel depth first search branch and bound algorithm for the quadratic assignment problem
- A parallel heuristic for quadratic assignment problems
- A performance guarantee heuristic for electronic components placement problems including thermal effects
- A quadratic assignment formulation of the molecular conformation problem
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A solvable case of the quadratic assignment problem
- A study of diversification strategies for the quadratic assignment problem
- A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem.
- A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices
- A tabu search algorithm for the quadratic assignment problem
- A thermodynamically motivated simulation procedure for combinatorial optimization problems
- Adaptive memory programming: a unified view of metaheuristics
- Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
- Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP
- An n‐step, 2‐variable search algorithm for the component placement problem
- An Algorithm for Solving 3-Dimensional Assignment Problems with Application to Scheduling a Teaching Practice
- An Algorithm for the Quadratic Assignment Problem
- An Algorithm for the Three-Index Assignment Problem
- An Exact Algorithm for the Quadratic Assignment Problem on a Tree
- An algorithm for quadratic assignment problems
- An algorithm for the multiprocessor assignment problem
- An algorithm for the planar three-index assignment problem
- An algorithm for the quadratic assignment problem using Benders' decomposition
- An ant colony system for permutation flow-shop sequencing
- An asymptotically exact polynomial algorithm for equipartition problems
- An exact algorithm for the general quadratic assignment problem
- An exact branch-and-bound procedure for the quadratic-assignment problem
- An extreme point algorithm for a local minimum solution to the quadratic assignment problem
- An improved annealing scheme for the QAP
- An optimal tree search method for the manufacturing systems cell formation problem
- Ant colonies for the quadratic assignment problem
- Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing
- Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property: An investigation of generation mechanism
- Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem
- Applying an extended guided local search to the quadratic assignment problem
- Approximate solutions to the turbine balancing problem.
- Approximating the maximum quadratic assignment problem
- Approximation algorithms for multi-dimensional assignment problems with decomposable costs
- Approximation algorithms for three-dimensional assignment problems with triangle inequalities
- Assignment Problems and the Location of Economic Activities
- Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
- Asymptotic Properties of the Quadratic Assignment Problem
- Backtracking of jobs in one-dimensional machine location problems
- Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem
- Best reduction of the quadratic semi-assignment problem
- Bounds on the Performance of Vector-Quantizers Under Channel Errors
- Box-inequalities for quadratic assignment polytopes
- Classes of quadratic assignment problem instances: Isomorphism and difficulty measure using a statistical approach
- Combining evolutionary computation and dynamic programming for solving a dynamic facility layout problem
- Comparison of iterative searches for the quadratic assignment problem
- Complexity of a 3-dimensional assignment problem
- Compounded genetic algorithms for the quadratic assignment problem
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition
- Computational results of an interior point algorithm for large scale linear programming
- Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Contributions to the quadratic assignment problem
- Copositive and semidefinite relaxations of the quadratic assignment problem
- Directional decomposition heuristic for a linear machine-cell location problem.
- Doubly constrained network for combinatorial optimization
- Efficient genetic algorithms using simple genes exchange local search policy for the quadratic assignment problem
- Eigenvalue bounds versus semidefinite relaxations for the quadratic assignment problem
- Evolutionary Computation in Combinatorial Optimization
- Evolutionary Computation in Combinatorial Optimization
- Evolutionary Computation in Combinatorial Optimization
- Extensions of a tabu search adaptation to the quadratic assignment problem
- Extensive testing of a hybrid genetic algorithm for solving quadratic assignment problems
- Facets of the three-index assignment polytope
- Fast equi-partitioning of rectangular domains using stripe decomposition
- From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems
- Generating hard test instances with known optimal solution for the rectilinear quadratic assignment problem
- Generating quadratic assignment test problems with known optimal permutations
- Greedy randomized adaptive search procedures
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Heuristics for biquadratic assignment problems and their computational comparison
- Heuristics from Nature for Hard Combinatorial Optimization Problems
- Hope: A genetic algorithm for the unequal area facility layout problem.
- Hospital Layout as a Quadratic Assignment Problem
- Implementation of a Variance Reduction-Based Lower Bound in a Branch-and-Bound Algorithm for the Quadratic Assignment Problem
- Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory
- Improved lower bounds for the quadratic assignment problem
- Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation
- Iterated local search for the quadratic assignment problem
- Lagrangean decomposition for integer nonlinear programming with linear constraints
- Large-scale layout of facilities using a heuristic hybrid algorithm
- Letter to the Editor—The Multidimensional Assignment Problem
- Linear-time separation algorithms for the three-index assignment polytope
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
- Locating cells with bottleneck machines in cellular manufacturing systems
- Location, scheduling, design and integer programming
- Lower bounds based on linear programming for the quadratic assignment problem
- Lower bounds for nonlinear assignment problems using many body interactions
- Lower bounds for the quadratic assignment problem
- Lower bounds for the quadratic assignment problem based upon a dual formulation
- Lower bounds for the quadratic assignment problem via triangle decompositions
- Massively parallel tabu search for the quadratic assignment problem
- Mechanisms for local search
- Metaheuristics: A bibliography
- Modeling and Analysis of Congestion in the Design of Facility Layouts
- Move based heuristics for the unidirectional loop network layout problem
- Multi colony ant algorithms
- Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking
- Network-based formulations of the quadratic assignment problem
- Numerical investigations on quadratic assignment problems
- On Latin squares and the facial structure of related polytopes
- On Solving A One-Dimensional Space Allocation Problem With Integer Programming
- On lower bounds for a class of quadratic 0,1 programs
- On random quadratic bottleneck assignment problems
- On the SQAP-polytope
- On the Use of Exact and Heuristic Cutting Plane Methods for the Quadratic Assignment Problem
- On the applicability of lower bounds for solving rectilinear quadratic assignment problems in parallel
- On the classification of NP-complete problems in terms of their correlation coefficient
- On the landscape ruggedness of the quadratic assignment problem
- On the quadratic assignment problem
- On the quality of heuristic solutions to a 19\(\times 19\) quadratic assignment problem
- On the quality of local search for the quadratic assignment problem
- One-dimensional machine location problems in a multi-product flowline with equidistant locations
- Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
- Optimization by simulated annealing
- Optimizing simulated annealing schedules with genetic programming
- P-Complete Approximation Problems
- Parallel Ant Colonies for the quadratic assignment problem
- Parallel genetic algorithms with local search
- Performance ratio of polynomial heuristics for triangle inequality quadratic assignment problems
- Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number
- QAPLIB - a quadratic assignment problem library
- QAPLIB-A quadratic assignment problem library
- QUADRATIC ASSIGNMENT AS A GENERAL DATA ANALYSIS STRATEGY
- Quadratic assignment problem QAP with adaptable material handling devices
- Quadratic assignment problems
- Quadratic assignment problems and \(M/G/C/C/\) state dependent network flows
- Ranking scalar products to improve bounds for the quadratic assignment problem
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
- Recent advances in the solution of quadratic assignment problems
- Redinv-SA: la simulated annealing for the quadratic assignment problem
- Room allocation: a polynomial subcase of the quadratic assignment problem
- Scheduling Parallel Production Lines with Changeover Costs: Practical Application of a Quadratic Assignment/LP Approach
- Selected topics on assignment problems
- Semidefinite programming relaxations for the quadratic assignment problem
- Simple approaches to parallel branch and bound
- Simulated annealing and genetic algorithms for the facility layout problem: A survey
- Simulated annealing and tabu search in the long run: A comparison on QAP tasks
- Solution methods for the balancing of jet turbines
- Solution procedures for the dynamic facility layout problem
- Solutions for the constrained dynamic facility layout problem
- Solving Lift-and-Project Relaxations of Binary Integer Programs
- Solving large quadratic assignment problems in parallel
- Solving large quadratic assignment problems on computational grids
- Solving large-scale QAP problems in parallel with the serach library ZRAM
- Solving quadratic assignment problems using convex quadratic programming relaxations
- Solving quadratic assignment problems with rectangular distances and integer programming
- Special cases of the quadratic assignment problem
- Strengthening Gilmore's bound for the quadratic assignment problem
- Strong duality for a trust-region type relaxation of the quadratic assignment problem
- Symmetrization of nonsymmetric quadratic assignment problems and the Hoffman-Wielandt inequality
- Tabu Search Applied to the Quadratic Assignment Problem
- Tabu Search—Part I
- Tabu Search—Part II
- Tabu search and design optimization
- Tabu search for the planar three-index assignment problem
- The Backboard Wiring Problem: A Placement Algorithm
- The Distribution of Values in the Quadratic Assignment Problem
- The QAP-polytope and the star transformation
- The Use of Specially Structured Models for Obtaining Bounds in the Quadratic Assignment Problem
- The extended concentric tabu for the quadratic assignment problem
- The quadratic assignment problem
- The quadratic assignment problem in the context of the printed circuit board assembly process
- The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
- The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: easy and hard cases
- The quadratic assignment problem. Theory and algorithms
- The quadratic three-dimensional assignment problem: exact and approximate solution methods
- Three-dimensional axial assignment problems with decomposable cost coefficients
- Tree-search algorithms for quadratic assignment problems
- Un Algorithme De Génération De Coupes Pour Le Problème De L’Affectation Quadratique
- Using quadratic assignment methods to generate initial permutations for least-squares unidimensional scaling of symmetric proximity matrices.
- Variable neighborhood search
Cited in
(only showing first 100 items - show all)- Copositive and semidefinite relaxations of the quadratic assignment problem
- Recent advances in the solution of quadratic assignment problems
- Global optimization of a class of nonconvex quadratically constrained quadratic programming problems
- A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- A splitting method for orthogonality constrained problems
- Generating QAP instances with known optimum solution and additively decomposable cost function
- The multi-story space assignment problem
- Global optimality conditions and optimization methods for quadratic assignment problems
- A deterministic annealing algorithm for approximating a solution of the min-bisection problem
- A hybrid biased random key genetic algorithm for the quadratic assignment problem
- To lay out or not to lay out?
- Integer point sets minimizing average pairwise \(L_{1}\) distance: What is the optimal shape of a town?
- An efficient continuation method for quadratic assignment problems
- A cooperative parallel tabu search algorithm for the quadratic assignment problem
- Mathematical modeling and efficient optimization methods for the distance-dependent rearrangement clustering problem
- Website structure improvement: quadratic assignment problem approach and ant colony meta-heuristic technique
- Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions
- A note on asymptotic properties of the quadratic assignment problem
- Linear programming insights into solvable cases of the quadratic assignment problem
- Discrete and geometric branch and bound algorithms for~medical image registration
- The quadratic assignment problem. Theory and algorithms
- A survey of meta-heuristic solution methods for the quadratic assignment problem
- A memetic heuristic for the generalized quadratic assignment problem
- A survey of hidden convex optimization
- An implementation of the iterated tabu search algorithm for the quadratic assignment problem
- Fast simulated annealing for single-row equidistant facility layout
- Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers
- A branch-and-bound algorithm for the single-row equidistant facility layout problem
- Exact solution of emerging quadratic assignment problems
- A new exact discrete linear reformulation of the quadratic assignment problem
- Continuation methods for approximate large scale object sequencing
- Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting
- SIMD tabu search for the quadratic assignment problem with graphics hardware acceleration
- \(L_p\)-norm regularization algorithms for optimization over permutation matrices
- An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems
- A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem
- Asymptotic Properties of the Quadratic Assignment Problem
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach
- New linearizations of quadratic assignment problems
- Random assignment problems
- Linear and quadratic programming approaches for the general graph partitioning problem
- A Branch-and-Bound Algorithm for Team Formation on Social Networks
- An algorithm for the generalized quadratic assignment problem
- The random quadratic assignment problem
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study
- On the geometry of graph spaces
- Evolutionary decision-makings for the dynamic weapon-target assignment problem
- Single row layout models
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Randomized Decomposition Solver with the Quadratic Assignment Problem as a Case Study
- On improving convex quadratic programming relaxation for the quadratic assignment problem
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique
- A semidefinite optimization approach to the target visitation problem
- A hybrid ant colony optimization algorithm for solving facility layout problems formulated as quadratic assignment problems
- A new relaxation framework for quadratic assignment problems based on matrix splitting
- Effective formulation reductions for the quadratic assignment problem
- scientific article; zbMATH DE number 1803767 (Why is no real title available?)
- Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem
- A nonmonotone GRASP
- Combining and solving sequence dependent traveling salesman and quadratic assignment problems in PCB assembly
- scientific article; zbMATH DE number 714526 (Why is no real title available?)
- QPLIB: a library of quadratic programming instances
- An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes
- Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Complete description for the spanning tree problem with one linearised quadratic term
- A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems
- A revised reformulation-linearization technique for the quadratic assignment problem
- A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes
- Classes of quadratic assignment problem instances: Isomorphism and difficulty measure using a statistical approach
- An improved linearization strategy for zero-one quadratic programming problems
- New variable-length data compression scheme for solution representation of meta-heuristics
- An exact qubit allocation approach for NISQ architectures
- Fairer comparisons for travelling salesman problem solutions using hash functions
- An LP-based characterization of solvable QAP instances with chess-board and graded structures
- Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters
- Complexity and polynomially solvable special cases of QUBO
- Sharing in construction projects -- on determining optimal container assignments for the on-site accommodation of trades
- Comparing QUBO models for quantum annealing: integer encodings for permutation problems
- Finding optimal solutions to several gray pattern instances
- Embedding signed graphs in the line
- MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems
- Exact solution of two location problems via branch-and-bound
- Research trends in combinatorial optimization
- A relative position-coded differential evolution for loop-based station sequencing problem
- BRANCHING TECHNIQUE FOR A BI-OBJECTIVE TWO-STAGE ASSIGNMENT PROBLEM
- A New Neighborhood for the QAP
- Dual track and segmented single track bidirectional loop guidepath layout for AGV systems
- Scalable semidefinite programming
- The dynamic space allocation problem: applying hybrid GRASP and tabu search metaheuristics
- Image matching from handcrafted to deep features: a survey
- Convex hull presentation of A quadratically constrained set and its application in solving quadratic programming problems
- Generating constrained length personalized bicycle tours
- Image Keypoint Matching Using Graph Neural Networks
- Improved exact approaches for row layout problems with departments of equal length
- Survey of quantitative methods in construction
- The generalised machine layout problem
- A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique
- Spectral relaxations and branching strategies for global optimization of mixed-integer quadratic programs
This page was built for publication: A survey for the quadratic assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q852928)
