A heuristic for quadratic Boolean programs with applications to quadratic assignment problems |
| |
| Authors: | Rainer E. Burkard Tilman Bönniger |
| |
| Affiliation: | Institut für Mathematik, Technische Universität Graz, A-8010 Graz, Austria;Rechenzentrum der Universität zu Köln D-5000 Köln 41, Germany, Fed. Rep. |
| |
| Abstract: | A heuristic for quadratic Boolean programs is presented. Computational tests with quadratic assignment problems (QAP) showed that it finds very good suboptimal solutions in moderate time and behaves computationally stable. In the appendix a FORTRAN-program for QAP is listed which improves an earlier code published by Burkard and Derigs. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
