Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem

Cited in

(only showing first 100 items - show all)

Quadratic assignment problems
A branch and bound algorithm for the acyclic subgraph problem
Convergence of a modified algorithm of fast probabilistic modeling
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
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
Algorithms for robust single and multiple period layout planning for manufacturing systems
Heuristische Verfahren zur Lösung quadratischer Zuordnungsprobleme
Exact solution of two location problems via branch-and-bound
Towards an abstract parallel branch and bound machine
A new semidefinite programming relaxation for the quadratic assignment problem and its computational perspectives
Near-optimal heuristics for an assignment problem in mass storage
The quadratic shortest path problem: complexity, approximability, and solution methods
The linearization problem of a binary quadratic problem and its applications
FALSA-facilities allocation by statistical analysis Part I. Further investigations on the cost distribution associated with the problem of facilities design
FALSA-Facilities allocation by statistical analysis Part II. An heuristic algorithm to the problem of facilities design
Constrained 0-1 quadratic programming: basic approaches and extensions
The QAP-polytope and the star transformation
Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
Multiple objective programming for the quadratic assignment problem
Simulated annealing for machine layout problems in the presence of zoning constraints
Global optimality conditions and optimization methods for quadratic assignment problems
An optimal tree search method for the manufacturing systems cell formation problem
Move based heuristics for the unidirectional loop network layout problem
Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
A survey for the quadratic assignment problem
A neural network approach to facility layout problems
Lower bounds for nonlinear assignment problems using many body interactions
Network-based formulations of the quadratic assignment problem
An efficient heuristic for the \(k\)-partitioning problem
Strengthening Gilmore's bound for the quadratic assignment problem
Solution methods for the balancing of jet turbines
A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method
Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem
Disentangling relationships in symptom networks using matrix permutation methods
Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting
A variant of time minimizing assignment problem
Gilmore-Lawler bound of quadratic assignment problem
Lower bounds based on linear programming for the quadratic assignment problem
A level-2 reformulation-linearization technique bound for the quadratic assignment problem
A novel SDP relaxation for the quadratic assignment problem using cut pseudo bases
A heuristic for cyclic stochastic sequencing of tasks on a drum-like storage system
A branch-and-bound algorithm for the single-row equidistant facility layout problem
Website structure improvement: quadratic assignment problem approach and ant colony meta-heuristic technique
Generating QAP instances with known optimum solution and additively decomposable cost function
Spanning and splitting: integer semidefinite programming for the quadratic minimum spanning tree problem
Lower bounds for the quadratic assignment problem via triangle decompositions
A new linearization method for quadratic assignment problems
Lower bounding procedures for the single allocation hub location problem
Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation
On the quadratic assignment problem
A hybrid heuristic for the facilities layout problem
Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing
Efficient estimation of the modified Gromov-Hausdorff distance between unweighted graphs
Optimizing simulated annealing schedules with genetic programming
Location and layout planning. A survey
Variable neighborhood search for the workload balancing problem in service enterprises
A parallel heuristic for quadratic assignment problems
Integer programming in psychology: a review and directions for future research
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
An algorithm for quadratic assignment problems
Taking advantage of symmetry in some quadratic assignment problems
Single and multiple period layout models for automated manufacturing systems
Optimal sequences in stochastic single machine shops
Mapping the convergence of genetic algorithms
Relative-interior solution for the (incomplete) linear assignment problem with applications to the quadratic assignment problem
Layout design for flexible manufacturing systems
Lower bounds and exact algorithms for the quadratic minimum spanning tree problem
Single- and multi-objective facility layout with workflow interference considerations
A quadratic simplex algorithm for primal optimization over zero-one polytopes
SDP relaxations for some combinatorial optimization problems
Where the really hard quadratic assignment problems are: the QAP-SAT instances
A convex form of the quadratic assignment problem
Branch-and-bound algorithms for the K -cluster problem based on SDP bounds evaluated by Lagrangian relaxation
Exact algorithms for the solution of the grey pattern quadratic assignment problem
A parallel branch and bound algorithm for the quadratic assignment problem
Computational performance and efficiency of lower-bound procedures for the dynamic facility layout problem
Mathematical modeling and efficient optimization methods for the distance-dependent rearrangement clustering 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 quadratic three-dimensional assignment problem: exact and approximate solution methods
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
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

This page was built for publication: Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem

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