A polynomial case of convex integer quadratic programming problems with box integer constraints (Q496616)

From MaRDI portal
Revision as of 18:52, 10 July 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
A polynomial case of convex integer quadratic programming problems with box integer constraints
scientific article

    Statements

    A polynomial case of convex integer quadratic programming problems with box integer constraints (English)
    0 references
    0 references
    0 references
    22 September 2015
    0 references
    quadratic integer optimization
    0 references
    polynomial solvable case
    0 references
    box constrained
    0 references
    0 references
    0 references
    0 references

    Identifiers