Complexity of uniqueness and local search in quadratic 0-1 programming (Q1197889)

From MaRDI portal
Revision as of 15:33, 16 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Complexity of uniqueness and local search in quadratic 0-1 programming
scientific article

    Statements

    title
    Complexity of uniqueness and local search in quadratic 0-1 programming (English)
    0 references
    author
    Panos M. Pardalos
    0 references
    Somesh Jha
    0 references
    publication date
    16 January 1993
    0 references
    zbMATH Keywords
    uniqueness
    0 references
    quadratic 0-1 problem
    0 references
    NP-hard
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90C09
    0 references
    90C20
    0 references
    90C60
    0 references
    zbMATH DE Number
    92005
    0 references
    OpenAlex ID
    W1971496656
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1197889&oldid=34095230"
    Powered by MediaWiki