A strongly polynomial FPTAS for the symmetric quadratic knapsack problem (Q439504)

From MaRDI portal
Revision as of 01:42, 9 December 2024 by Import241208021249 (talk | contribs) (Normalize DOI.)
scientific article
Language Label Description Also known as
English
A strongly polynomial FPTAS for the symmetric quadratic knapsack problem
scientific article

    Statements

    A strongly polynomial FPTAS for the symmetric quadratic knapsack problem (English)
    0 references
    0 references
    16 August 2012
    0 references
    combinatorial optimization
    0 references
    quadratic knapsack
    0 references
    FPTAS
    0 references
    strongly polynomial time
    0 references
    machine scheduling
    0 references

    Identifiers

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