Randomized time‐varying knapsack problems via binary beetle antennae search algorithm: Emphasis on applications in portfolio insurance (Q5003938): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:05, 8 February 2024
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
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
