Convex quadratic and semidefinite programming relaxations in scheduling (Q3196615)

From MaRDI portal
Revision as of 01:20, 2 September 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
Convex quadratic and semidefinite programming relaxations in scheduling
scientific article

    Statements

    Convex quadratic and semidefinite programming relaxations in scheduling (English)
    0 references
    0 references
    30 October 2015
    0 references
    approximation algorithms
    0 references
    convex optimization
    0 references
    performance guarantee
    0 references
    randomized algorithms
    0 references
    scheduling theory
    0 references
    unrelated machines
    0 references
    worst-case ratio
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references