Bilevel programming with knapsack constraints (Q5949871)

From MaRDI portal
Revision as of 00:54, 22 December 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1678792
Language Label Description Also known as
English
Bilevel programming with knapsack constraints
scientific article; zbMATH DE number 1678792

    Statements

    Bilevel programming with knapsack constraints (English)
    0 references
    0 references
    0 references
    5 December 2001
    0 references
    knapsack constraints
    0 references
    bilevel programming problems
    0 references
    polynomial approximate algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references