The quadratic assignment problem
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing
- A continuous districting model focusing on intra‐ and inter‐zonal squared distances and its Voronoi‐based heuristic
- L_p-norm regularization algorithms for optimization over permutation matrices
- Optimizing simulated annealing schedules with genetic programming
- Efficient models for the facility layout problem
- A parallel heuristic for quadratic assignment problems
- Integer programming in psychology: a review and directions for future research
- Posterior agreement for large parameter-rich optimization problems
- Methods for the one-dimensional space allocation problem
- A layout design heuristic employing the theory of fuzzy sets
- Quantum computing for discrete optimization: a highlight of three technologies
- A systematic encoding of the quadratic assignment problem onto Rydberg arrays
- Cotas inferiores para el QAP-Arbol
- The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm
- A heuristic method for the multi-story layout problem
- The facility layout problem
- Single and multiple period layout models for automated manufacturing systems
- Image matching from handcrafted to deep features: a survey
- Mapping the convergence of genetic algorithms
- Relative-interior solution for the (incomplete) linear assignment problem with applications to the quadratic assignment problem
- Measuring instance difficulty for combinatorial optimization problems
- Layout design for flexible manufacturing systems
- Sinkhorn Algorithm for Lifted Assignment Problems
- Lower bounds and exact algorithms for the quadratic minimum spanning tree problem
- Single- and multi-objective facility layout with workflow interference considerations
- Improving defensive air battle management by solving a stochastic dynamic assignment problem via approximate dynamic programming
- A fast projected fixed-point algorithm for large graph matching
- Comparison of the performance of modern heuristics for combinatorial optimization on real data
- A quadratic simplex algorithm for primal optimization over zero-one polytopes
- SDP relaxations for some combinatorial optimization problems
- A -accurate linearization method of Euclidean distance for the facility layout problem with heterogeneous distance metrics
- Locating names on vertices of a transaction network
- Branch-and-bound algorithms for the K -cluster problem based on SDP bounds evaluated by Lagrangian relaxation
- A priority based unbalanced time minimization assignment problem
- An experimental study of variable depth search algorithms for the quadratic assignment problem
- Exact solution of emerging quadratic assignment problems
- Computational performance and efficiency of lower-bound procedures for the dynamic facility layout problem
- A contribution to quadratic assignment problems
- A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices
- A ‘fuzzy’ heuristic for the quadratic assignment formulation to the facility layout problem
- An exceptionally difficult binary quadratic optimization problem with symmetry: a challenge for the largest unsolved QAP instance Tai256c
- A location problem on unicyclic networks: Balanced case
- A distance assignment approach to the facility layout problem
- The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows
- Extended neighborhood: Definition and characterization
- The quadratic three-dimensional assignment problem: exact and approximate solution methods
- A heuristic procedure for the single-row facility layout problem
- Maximizing Polynomials Subject to Assignment Constraints
- Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers
- A parallel depth first search branch and bound algorithm for the quadratic assignment problem
- The quadratic cycle cover problem: special cases and efficient bounds
- Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters
- Continuous optimization methods for the graph isomorphism problem
- A Lagrangian relaxation algorithm for sparse quadratic assignment problems
- Generating quadratic assignment test problems with known optimal permutations
- Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation
- The quadratic minimum spanning tree problem: lower bounds via extended formulations
- Quadratic Combinatorial Optimization Using Separable Underestimators
- A GRASP for the biquadratic assignment problem
- Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search
- A generalized Gilmore-Lawler procedure for the quadratic assignment problem
- Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems
- Reconfigurable layout problem
- A genetic algorithm for facility layout
- Contributions to the quadratic assignment problem
- Dominant Z-Eigenpairs of Tensor Kronecker Products Decouple
- A heuristic procedure for solving the quadratic assignment problem
- ADMM for the SDP relaxation of the QAP
- Algorithms for electric vehicle scheduling in large-scale mobility-on-demand schemes
- Quadratic assignment problems
- An exact algorithm for the general quadratic assignment problem
- A new relaxation framework for quadratic assignment problems based on matrix splitting
- Effective formulation reductions for the quadratic assignment problem
- A revised reformulation-linearization technique for the quadratic assignment problem
- Lower bounds for the quadratic assignment problem
- A new exact algorithm for the solution of quadratic assignment problems
- An algorithm for the quadratic assignment problem using Benders' decomposition
- RLT insights into lift-and-project closures
- An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating
- Algorithms for robust single and multiple period layout planning for manufacturing systems
- Exact procedures for solving the discrete ordered median problem
- The Rank-One Quadratic Assignment Problem
- Natalie 2.0: sparse global network alignment as a special case of quadratic assignment
- Heuristische Verfahren zur Lösung quadratischer Zuordnungsprobleme
- Repulsive assignment problem
- Exact solution of two location problems via branch-and-bound
- A new semidefinite programming relaxation for the quadratic assignment problem and its computational perspectives
- On the maximum edge-pair embedding bipartite matching
- Integrating combinatorial algorithms into a linear programming solver
- A new class of hard problem instances for the 0-1 knapsack problem
- The quadratic shortest path problem: complexity, approximability, and solution methods
- A new greedy algorithm for the quadratic assignment problem
- Seeking affinity structure: strategies for improving \(m\)-best graph matching
- A greedy genetic algorithm for the quadratic assignment problem
- The linearization problem of a binary quadratic problem and its applications
- A performance guarantee heuristic for electronic components placement problems including thermal effects
- FALSA-facilities allocation by statistical analysis Part I. Further investigations on the cost distribution associated with the problem of facilities design
- The independent quadratic assignment problem: complexity and polynomially solvable special cases
- Constrained 0-1 quadratic programming: basic approaches and extensions
- New linearizations of quadratic assignment problems
This page was built for publication: The quadratic assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2778995)
