A survey for the quadratic assignment problem

From MaRDI portal

Publication:852928

Jump to:navigation, search

DOI10.1016/j.ejor.2005.09.032zbMath1103.90058OpenAlexW2013603106MaRDI QIDQ852928

Peter M. Hahn, Paulo Oswaldo Boaventura-Netto, Nair Maria Maia De Abreu, Eliane Maria Loiola, Tania M. Querido

Publication date: 15 November 2006

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.09.032

zbMATH Keywords

integer programming combinatorial optimization metaheuristics branch and bound assignment facilities planning and design

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items

Facility layout problem with QAP formulation under scenario-based uncertainty, An efficient algorithm for unequal area facilities layout planning with input and output points, BRANCHING TECHNIQUE FOR A BI-OBJECTIVE TWO-STAGE ASSIGNMENT PROBLEM, Complexity and Polynomially Solvable Special Cases of QUBO, Image Keypoint Matching Using Graph Neural Networks, A Branch-and-Bound Algorithm for Team Formation on Social Networks, A note on the exact solution of the minimum squared load assignment problem, Gilmore-Lawler bound of quadratic assignment problem, On the generalized trace ratio problem, Research trends in combinatorial optimization, Characterizing linearizable QAPs by the level-1 reformulation-linearization technique, Sinkhorn Algorithm for Lifted Assignment Problems, Fairer comparisons for travelling salesman problem solutions using hash functions, An LP-based characterization of solvable QAP instances with chess-board and graded structures, The ‘Idiot’ crash quadratic penalty algorithm for linear programming and its application to linearizations of quadratic assignment problems, A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique, Randomized Decomposition Solver with the Quadratic Assignment Problem as a Case Study, Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters, Spectral Relaxations and Branching Strategies for Global Optimization of Mixed-Integer Quadratic Programs, A hybrid ant colony optimization algorithm for solving facility layout problems formulated as quadratic assignment problems, Complete Description of Matching Polytopes with One Linearized Quadratic Term for Bipartite Graphs, Exact Solution of Two Location Problems via Branch-and-Bound, 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, A relative position-coded differential evolution for loop-based station sequencing problem, The generalised machine layout problem, SIMD tabu search for the quadratic assignment problem with graphics hardware acceleration, An improved heuristic approach for multi-objective facility layout problem, Copositive and semidefinite relaxations of the quadratic assignment problem, A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes, A new class of hard problem instances for the 0-1 knapsack problem, Mathematical modeling and efficient optimization methods for the distance-dependent rearrangement clustering problem, A cooperative parallel tabu search algorithm for the quadratic assignment problem, 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, Exact Recovery with Symmetries for the Doubly Stochastic Relaxation, Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances, An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes, Survey of quantitative methods in construction, Improved exact approaches for row layout problems with departments of equal length, A nonmonotone GRASP, On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study, An efficient continuation method for quadratic assignment problems, A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems, Fast simulated annealing for single-row equidistant facility layout, Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers, Structured linear reformulation of binary quadratically constrained quadratic programs, Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach, A survey of hidden convex optimization, Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic \(0-1\) optimization problems with linear constraints, New variable-length data compression scheme for solution representation of meta-heuristics, Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2, A new exact discrete linear reformulation of the quadratic assignment problem, The multi-story space assignment problem, Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem, Minimum energy configurations on a toric lattice as a quadratic assignment problem, Locating names on vertices of a transaction network, Generating QAP instances with known optimum solution and additively decomposable cost function, Decorous combinatorial lower bounds for row layout problems, A New Neighborhood for the QAP, Integer point sets minimizing average pairwise \(L_{1}\) distance: What is the optimal shape of a town?, An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems, A semidefinite optimization approach to the target visitation problem, An exact qubit allocation approach for NISQ architectures, Garden optimization problems for benchmarking quantum annealers, Dual track and segmented single track bidirectional loop guidepath layout for AGV systems, A branch-and-bound algorithm for the single-row equidistant facility layout problem, Global optimality conditions and optimization methods for quadratic assignment problems, MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems, An implementation of the iterated tabu search algorithm for the quadratic assignment problem, Global optimization of a class of nonconvex quadratically constrained quadratic programming problems, Linear and quadratic programming approaches for the general graph partitioning problem, Optimal rates of statistical seriation, A splitting method for orthogonality constrained problems, Complete description for the spanning tree problem with one linearised quadratic term, The random quadratic assignment problem, Generating constrained length personalized bicycle tours, An improved linearization strategy for zero-one quadratic programming problems, An exact algorithm for the minimum squared load assignment problem, Exact solution of emerging quadratic assignment problems, Continuation methods for approximate large scale object sequencing, On improving convex quadratic programming relaxation for the quadratic assignment problem, An experimental study of variable depth search algorithms for the quadratic assignment problem, Website structure improvement: quadratic assignment problem approach and ant colony meta-heuristic technique, Semidefinite programming approach for the quadratic assignment problem with a sparse graph, An efficient variable neighborhood search for the space-free multi-row facility layout problem, Random assignment problems, Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions, New special cases of the quadratic assignment problem with diagonally structured coefficient matrices, ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations, Embedding signed graphs in the line, New linearizations of quadratic assignment problems, Discrete and geometric branch and bound algorithms for~medical image registration, The dynamic space allocation problem: applying hybrid GRASP and tabu search metaheuristics, A TISSUE P SYSTEM BASED SOLUTION TO QUADRATIC ASSIGNMENT PROBLEM, Effective formulation reductions for the quadratic assignment problem, Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique, A new relaxation framework for quadratic assignment problems based on matrix splitting, Relaxations for Minimizing Metric Distortion and Elastic Energies for 3D Shape Matching, QPLIB: a library of quadratic programming instances, Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search, Evaluation of the multiobjective ant colony algorithm performances on biobjective quadratic assignment problems, A fast algorithm to generate feasible solution of production facilities layout based on plane segmentation, An algorithm for the generalized quadratic assignment problem, Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting, Using constraint programming for the design of network-on-chip architectures, Combining and solving sequence dependent traveling salesman and quadratic assignment problems in PCB assembly, New exact approaches to row layout problems, A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem, Image matching from handcrafted to deep features: a survey, Matroid optimization problems with monotone monomials in the objective, $L_p$-norm Regularization Algorithms for Optimization Over Permutation Matrices, A Novel SDP Relaxation for the Quadratic Assignment Problem Using Cut Pseudo Bases, CONVEX HULL PRESENTATION OF A QUADRATICALLY CONSTRAINED SET AND ITS APPLICATION IN SOLVING QUADRATIC PROGRAMMING PROBLEMS, Robust optimization of internal transports at a parcel sorting center operated by Deutsche Post world net, Scalable Semidefinite Programming, Linear programming insights into solvable cases of the quadratic assignment problem, A revised reformulation-linearization technique for the quadratic assignment problem, Who should get vaccinated? Individualized allocation of vaccines over SIR network, Finding optimal solutions to several gray pattern instances

Uses Software

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:852928&oldid=12797806"