A tight upper bound for the \(k\)-partition problem on ideal sets (Q1306356)

From MaRDI portal
Revision as of 14:27, 18 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 tight upper bound for the \(k\)-partition problem on ideal sets
scientific article

    Statements

    A tight upper bound for the \(k\)-partition problem on ideal sets (English)
    0 references
    0 references
    0 references
    4 March 2001
    0 references
    Lagrange multipliers
    0 references
    mathematical programming
    0 references
    NP-complete
    0 references
    scheduling theory
    0 references
    worst-case analysis
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references