A new linearization method for quadratic assignment problems
From MaRDI portal
Publication:3423596
DOI10.1080/10556780500273077zbMath1112.90051OpenAlexW2003624199MaRDI QIDQ3423596
Publication date: 14 February 2007
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780500273077
Mixed integer programming (90C11) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Boolean programming (90C09)
Related Items
Facility layout problem with QAP formulation under scenario-based uncertainty ⋮ Improving hospital layout planning through clinical pathway mining ⋮ A geometric branch-and-bound algorithm for the service bundle design problem ⋮ Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers ⋮ Gilmore-Lawler bound of quadratic assignment problem ⋮ The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows ⋮ On linearization techniques for budget-constrained binary quadratic programming problems ⋮ On solving a hard quadratic 3-dimensional assignment problem ⋮ $L_p$-norm Regularization Algorithms for Optimization Over Permutation Matrices
Uses Software
Cites Work
- Unnamed Item
- Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
- On the quadratic assignment problem
- QAPLIB - a quadratic assignment problem library
- The quadratic assignment problem. Theory and algorithms
- A heuristic for quadratic Boolean programs with applications to quadratic assignment problems
- On the Assignment Polytope
- 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
- Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
