A new linearization method for quadratic assignment problems
From MaRDI portal
Publication:3423596
DOI10.1080/10556780500273077zbMATH Open1112.90051OpenAlexW2003624199MaRDI QIDQ3423596FDOQ3423596
Publication date: 14 February 2007
Published in: Optimization Methods \& Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780500273077
Recommendations
- New linearizations of quadratic assignment problems
- Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers
- A branch-and-cut algorithm for quadratic assignment problems based on linearizations
- A new exact discrete linear reformulation of the quadratic assignment problem
- A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems
Mixed integer programming (90C11) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Boolean programming (90C09)
Cites Work
- QAPLIB - a quadratic assignment problem library
- The quadratic assignment problem. Theory and algorithms
- Assignment Problems and the Location of Economic Activities
- Jointly Constrained Biconvex Programming
- P-Complete Approximation Problems
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- On the quadratic assignment problem
- Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
- On the Assignment Polytope
- A heuristic for quadratic Boolean programs with applications to quadratic assignment problems
- Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
- Title not available (Why is that?)
Cited In (18)
- Two classes of quadratic assignment problems that are solvable as linear assignment problems
- On solving a hard quadratic 3-dimensional assignment problem
- Improving hospital layout planning through clinical pathway mining
- Title not available (Why is that?)
- Title not available (Why is that?)
- A dual framework for lower bounds of the quadratic assignment problem based on linearization
- Gilmore-Lawler bound of quadratic assignment problem
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique
- \(L_p\)-norm regularization algorithms for optimization over permutation matrices
- A geometric branch-and-bound algorithm for the service bundle design problem
- Compact linearization for binary quadratic problems subject to assignment constraints
- A New Matrix Splitting Based Relaxation for the Quadratic Assignment Problem
- A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices
- The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows
- Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers
- Linear models and computational experiments for the quadratic TSP
- Facility layout problem with QAP formulation under scenario-based uncertainty
- On linearization techniques for budget-constrained binary quadratic programming problems
Uses Software
This page was built for publication: A new linearization method for quadratic assignment problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3423596)
