On the quadratic assignment problem

DOI10.1016/0166-218X(83)90018-5zbMath0502.90062OpenAlexW2061796216WikidataQ57401640 ScholiaQ57401640MaRDI QIDQ1173009

J. Yadegar, Alan M. Frieze

Publication date: 1983

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(83)90018-5

zbMATH Keywords

Lagrangean relaxationquadratic assignment problemlower boundslinear integer programming formulationsubgradient approach

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Boolean programming (90C09)

Related Items

Lower bounds for the quadratic assignment problem, The facility layout problem, A new mixed integer programming model for curriculum balancing: application to a Turkish university, Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delays, Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics, On linear programs with random costs, A survey for the quadratic assignment problem, The service allocation problem at the Gioia Tauro maritime terminal, Quadratic assignment problems, Optimal sequences in stochastic single machine shops, Inductive linearization for binary quadratic programs with linear constraints, A Survey of the Generalized Assignment Problem and Its Applications, Sinkhorn Algorithm for Lifted Assignment Problems, Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters, Compact linearization for binary quadratic problems subject to assignment constraints, Symmetrization of nonsymmetric quadratic assignment problems and the Hoffman-Wielandt inequality, An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations, Compact linearization for binary quadratic problems, New linearizations of quadratic assignment problems, Best reduction of the quadratic semi-assignment problem, RLT insights into lift-and-project closures, Selected topics on assignment problems, Effective formulation reductions for the quadratic assignment problem, The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm, A performance guarantee heuristic for electronic components placement problems including thermal effects, Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search, A contribution to quadratic assignment problems, A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices, Evaluating the quality of image matrices in blockmodeling, A priority based unbalanced time minimization assignment problem, On the Quadratic Programming Approach for Hub Location Problems, Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method, GRASP with path-relinking for the generalized quadratic assignment problem, Tight linear programming relaxations of uncapacitated \(p\)-hub median problems, The linearization problem of a binary quadratic problem and its applications, A Novel SDP Relaxation for the Quadratic Assignment Problem Using Cut Pseudo Bases, Lower bounds for nonlinear assignment problems using many body interactions, A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method, Hybrid algorithms for placement of virtual machines across geo-separated data centers, A new linearization method for quadratic assignment problems, A variant of time minimizing assignment problem, Linear programming insights into solvable cases of the quadratic assignment problem, A revised reformulation-linearization technique for the quadratic assignment problem, The minimum flow cost Hamiltonian cycle problem: a comparison of formulations, On lower bounds for a class of quadratic 0,1 programs

Cites Work

• Unnamed Item
• An algorithm for the quadratic assignment problem using Benders' decomposition
• The Quadratic Assignment Problem
• The Backboard Wiring Problem: A Placement Algorithm
• Assignment Problems and the Location of Economic Activities
• Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem
• A branch and bound algorithm for the Koopmans-Beckmann quadratic assignment problem
• The traveling salesman problem: A duality approach
• Numerical investigations on quadratic assignment problems
• An exact branch-and-bound procedure for the quadratic-assignment problem
• Validation of subgradient optimization
• Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem