On the quadratic assignment problem

DOI10.1016/0166-218X(83)90018-5MaRDI QIDQ1173009zbMATH OpenOpenAlexWikidataFDO

Authors J. Yadegar, Alan 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

quadratic assignment problemlower boundsLagrangean relaxationlinear 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)

Cites work

• scientific article; zbMATH DE number 3614502 (Why is no real title available?)
• A branch and bound algorithm for the Koopmans-Beckmann quadratic assignment problem
• An algorithm for the quadratic assignment problem using Benders' decomposition
• An exact branch-and-bound procedure for the quadratic-assignment problem
• Assignment Problems and the Location of Economic Activities
• Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem
• Numerical investigations on quadratic assignment problems
• Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
• The Backboard Wiring Problem: A Placement Algorithm
• The quadratic assignment problem
• The traveling salesman problem: A duality approach
• Validation of subgradient optimization

Cited in

(46)

• RLT insights into lift-and-project closures
• Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics
• The linearization problem of a binary quadratic problem and its applications
• A performance guarantee heuristic for electronic components placement problems including thermal effects
• Symmetrization of nonsymmetric quadratic assignment problems and the Hoffman-Wielandt inequality
• New linearizations of quadratic assignment problems
• Selected topics on assignment problems
• On linear programs with random costs
• On lower bounds for a class of quadratic 0,1 programs
• Best reduction of the quadratic semi-assignment problem
• The service allocation problem at the Gioia Tauro maritime terminal
• Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delays
• Tight linear programming relaxations of uncapacitated p-hub median problems
• Linear programming insights into solvable cases of the quadratic assignment problem
• A new mixed integer programming model for curriculum balancing: application to a Turkish university
• A survey for the quadratic assignment problem
• Lower bounds for nonlinear assignment problems using many body interactions
• Hybrid algorithms for placement of virtual machines across geo-separated data centers
• A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method
• An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations
• A variant of time minimizing assignment problem
• A novel SDP relaxation for the quadratic assignment problem using cut pseudo bases
• A Survey of the Generalized Assignment Problem and Its Applications
• A new linearization method for quadratic assignment problems
• The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm
• The facility layout problem
• The minimum flow cost Hamiltonian cycle problem: a comparison of formulations
• Optimal sequences in stochastic single machine shops
• Sinkhorn Algorithm for Lifted Assignment Problems
• GRASP with path-relinking for the generalized quadratic assignment problem
• Compact linearization for binary quadratic problems
• Compact linearization for binary quadratic problems subject to assignment constraints
• A priority based unbalanced time minimization assignment problem
• Inductive linearization for binary quadratic programs with linear constraints: a computational study
• 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
• 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
• Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters
• Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search
• Inductive linearization for binary quadratic programs with linear constraints
• Quadratic assignment problems
• 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

This page was built for publication: On the quadratic assignment problem

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