Randomized time‐varying knapsack problems via binary beetle antennae search algorithm: Emphasis on applications in portfolio insurance-Reference-Cited by-同舟云学术

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

Author:

Medvedeva Marina A.¹,Katsikis Vasilios N.²^ORCID,Mourtas Spyridon D.²,Simos Theodore E.³⁴⁵^ORCID

Affiliation:

1. Group of Modern Computational Methods Ural Federal University Yekaterinburg Russia Federation

2. Department of Economics, Division of Mathematics and Informatics National and Kapodistrian University of Athens Athens Greece

3. Digital Industry REC South Ural State University Chelyabinsk Russia

4. Data Recovery Key Laboratory of Sichun Province Neijing Normal University Neijiang China

5. Section of Mathematics, Department of Civil Engineering Democritus University of Thrace Xanthi Greece

Publisher

Wiley

Subject

General Engineering,General Mathematics

Link

Reference42 articles.

2. Greatest remainder bi‐proportional rounding and the greek parliamentary elections of 2007;Tsitouras Ch;Appl Math Comput,2011

Cited by 37 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献