A new linearization method for quadratic assignment problems
From MaRDI portal
Publication:3423596
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
Cites work
- A heuristic for quadratic Boolean programs with applications to quadratic assignment problems
- Assignment Problems and the Location of Economic Activities
- Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Improved Gilmore-Lawler bound for quadratic assignment problems
- Jointly Constrained Biconvex Programming
- On the Assignment Polytope
- On the quadratic assignment problem
- Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
- P-Complete Approximation Problems
- QAPLIB - a quadratic assignment problem library
- The quadratic assignment problem. Theory and algorithms
Cited in
(30)- Improving hospital layout planning through clinical pathway mining
- The linearization problem of a binary quadratic problem and its applications
- A new solution method by linearization for a special kind of quadratic assignment problem
- A geometric branch-and-bound algorithm for the service bundle design problem
- A dual framework for lower bounds of the quadratic assignment problem based on linearization
- On solving a hard quadratic 3-dimensional assignment problem
- A New Matrix Splitting Based Relaxation for the Quadratic Assignment Problem
- A branch-and-cut algorithm for quadratic assignment problems based on linearizations
- The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows
- A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices
- An efficient continuation method for quadratic assignment problems
- Dynamic sparsification for quadratic assignment problems
- Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers
- A new exact discrete linear reformulation of the quadratic assignment problem
- Gilmore-Lawler bound of quadratic assignment problem
- \(L_p\)-norm regularization algorithms for optimization over permutation matrices
- A solution method for the quadratic assignment problem based on the Hungarian algorithm
- New linearizations of quadratic assignment problems
- On linearization techniques for budget-constrained binary quadratic programming problems
- scientific article; zbMATH DE number 4072724 (Why is no real title available?)
- Compact linearization for binary quadratic problems subject to assignment constraints
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique
- Compact linearization for binary quadratic problems
- Linear models and computational experiments for the quadratic TSP
- Facility layout problem with QAP formulation under scenario-based uncertainty
- Two classes of quadratic assignment problems that are solvable as linear assignment problems
- A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems
- A revised reformulation-linearization technique for the quadratic assignment problem
- Characterizing linearizable QAPs by the level-1 reformulation-linearization technique
- scientific article; zbMATH DE number 5556512 (Why is no real title available?)
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)
