A heuristic for quadratic Boolean programs with applications to quadratic assignment problems

Rainer Ernst Burkard; Tilman Bönniger

doi:10.1016/0377-2217(83)90097-8

A heuristic for quadratic Boolean programs with applications to quadratic assignment problems

Rainer Ernst Burkard, Tilman Bönniger

Institute of Discrete Mathematics (5050)

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	374-386
Journal	European Journal of Operational Research
Volume	13
Issue number	4
DOIs	https://doi.org/10.1016/0377-2217(83)90097-8
Publication status	Published - 1983

Access to Document

10.1016/0377-2217(83)90097-8

Cite this

@article{a0965ac9a47b4f73b463cca29e8fbaef,

title = "A heuristic for quadratic Boolean programs with applications to quadratic assignment problems",

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.",

author = "Burkard, {Rainer Ernst} and Tilman B{\"o}nniger",

note = "Available online 13 January 2011.",

year = "1983",

doi = "10.1016/0377-2217(83)90097-8",

language = "English",

volume = "13",

pages = "374--386",

journal = "European Journal of Operational Research",

issn = "1872-6860",

publisher = "Elsevier B.V.",

number = "4",

}

TY - JOUR

T1 - A heuristic for quadratic Boolean programs with applications to quadratic assignment problems

AU - Burkard, Rainer Ernst

AU - Bönniger, Tilman

N1 - Available online 13 January 2011.

PY - 1983

Y1 - 1983

N2 - 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.

AB - 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.

U2 - 10.1016/0377-2217(83)90097-8

DO - 10.1016/0377-2217(83)90097-8

M3 - Article

SN - 1872-6860

VL - 13

SP - 374

EP - 386

JO - European Journal of Operational Research

JF - European Journal of Operational Research

IS - 4

ER -

A heuristic for quadratic Boolean programs with applications to quadratic assignment problems

Abstract

Access to Document

Fingerprint

Cite this