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

From MaRDI portal
Revision as of 18:47, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
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