A dual framework for lower bounds of the quadratic assignment|problem based on linearization

Stefan E. Karisch, E. Cela, Jens Clausen, Torben Grønvall Espersen

    Research output: Contribution to journalJournal articleResearchpeer-review

    Abstract

    A dual framework allowing the comparison of various bounds for the quadratic assignment problem (QAP) based on linearization, e.g. the bounds of Adams and Johnson, Carraresi and Malucelli, and Hahn and Grant, is presented. We discuss the differences of these bounds and propose a new and more general bounding procedure based on the dual of the linearization of Adams and Johnson. The new procedure has been applied to problems of dimension up to
    Original languageEnglish
    JournalComputing
    Volume63
    Issue number4
    Pages (from-to)351|- 403
    ISSN0010-485X
    Publication statusPublished - 1999

    Fingerprint Dive into the research topics of 'A dual framework for lower bounds of the quadratic assignment|problem based on linearization'. Together they form a unique fingerprint.

    Cite this