Randomized time‐varying knapsack problems via binary beetle antennae search algorithm: Emphasis on applications in portfolio insurance (Q5003938)

From MaRDI portal
Revision as of 15:35, 30 December 2024 by Import241228121245 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article; zbMATH DE number 7376651
Language Label Description Also known as
English
Randomized time‐varying knapsack problems via binary beetle antennae search algorithm: Emphasis on applications in portfolio insurance
scientific article; zbMATH DE number 7376651

    Statements

    Randomized time‐varying knapsack problems via binary beetle antennae search algorithm: Emphasis on applications in portfolio insurance (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 July 2021
    0 references
    knapsack problem
    0 references
    meta-heuristic optimization
    0 references
    portfolio optimization
    0 references
    time-varying integer linear programming
    0 references

    Identifiers

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