On the quadratic assignment problem
From MaRDI portal
Publication:1173009
Cites work
- 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
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- 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
(48)- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- On lower bounds for a class of quadratic 0,1 programs
- The facility layout problem
- Symmetrization of nonsymmetric quadratic assignment problems and the Hoffman-Wielandt inequality
- Tight linear programming relaxations of uncapacitated p-hub median problems
- 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
- A variant of time minimizing assignment problem
- Lower bounds for the quadratic assignment problem
- Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delays
- Compact linearization for binary quadratic problems subject to assignment constraints
- An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations
- New linearizations of quadratic assignment problems
- A performance guarantee heuristic for electronic components placement problems including thermal effects
- Optimal sequences in stochastic single machine shops
- Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search
- The linearization problem of a binary quadratic problem and its applications
- RLT insights into lift-and-project closures
- A priority based unbalanced time minimization assignment problem
- Hybrid algorithms for placement of virtual machines across geo-separated data centers
- 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
- Compact linearization for binary quadratic 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
- Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics
- A novel SDP relaxation for the quadratic assignment problem using cut pseudo bases
- A new mixed integer programming model for curriculum balancing: application to a Turkish university
- A contribution to quadratic assignment problems
- A new linearization method for quadratic assignment problems
- On the Quadratic Programming Approach for Hub Location Problems
- On linear programs with random costs
- Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters
- Best reduction of the quadratic semi-assignment problem
- Quadratic assignment problems
- 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
- Inductive linearization for binary quadratic programs with linear constraints: a computational study
- A systematic encoding of the quadratic assignment problem onto Rydberg arrays
- Selected topics on assignment problems
- Singleton node consistency for quadratic assignment problems in cost function networks
- GRASP with path-relinking for the generalized quadratic assignment problem
- A survey for the quadratic assignment problem
- The service allocation problem at the Gioia Tauro maritime terminal
- Effective formulation reductions for the quadratic assignment problem
- The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm
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)
