Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints (Q1651695)

From MaRDI portal
Revision as of 17:56, 24 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
Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints
scientific article

    Statements

    Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints (English)
    0 references
    0 references
    0 references
    0 references
    12 July 2018
    0 references
    combinatorial optimization
    0 references
    non-linear Boolean programming
    0 references
    geometric rounding
    0 references
    \(K\)-approximation sets and functions
    0 references
    FPTAS
    0 references

    Identifiers