Tightening a Discrete Formulation of the Quadratic Assignment Problem
The quadratic assignment problem is a well studied and notoriously difficult combinatorial problem. Recently, a discrete linear formulation of the quadratic assignment problem was presented that solved five previously unsolved instances from the quadratic assignment library, QAPLIB, to optimality. T...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AIDIC Servizi S.r.l.
2013-06-01
|
| Series: | Chemical Engineering Transactions |
| Online Access: | https://www.cetjournal.it/index.php/cet/article/view/6613 |