A unified approach to polynomially solvable cases of integer ``non-separable'' quadratic optimization (Q1897348)

From MaRDI portal
Revision as of 00:55, 29 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A unified approach to polynomially solvable cases of integer ``non-separable'' quadratic optimization
scientific article

    Statements

    A unified approach to polynomially solvable cases of integer ``non-separable'' quadratic optimization (English)
    0 references
    0 references
    23 June 1996
    0 references
    0 references
    0 references
    0 references
    0 references
    NP-hardness
    0 references
    polynomially solvable integer quadratic optimization
    0 references