Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan Distance Matrices Based on Semidefinite Programming (Q3083337)

From MaRDI portal
Revision as of 21:49, 3 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan Distance Matrices Based on Semidefinite Programming
scientific article

    Statements

    Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan Distance Matrices Based on Semidefinite Programming (English)
    0 references
    0 references
    0 references
    21 March 2011
    0 references
    quadratic assignment problem
    0 references
    semidefinite programming
    0 references
    singular value decomposition
    0 references
    relaxation
    0 references
    lower bound
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references