Exact algorithms and evolutionary algorithms for randomized time-varying knapsack problem

DOI10.13328/J.CNKI.JOS.004937MaRDI QIDQ5368630zbMATH OpenFDO

Authors Wenbin Li, Shu-Liang Zhao, Yichao He, Xi-Zhao Wang

Publication date 20 October 2017

Full work available at URL https://doi.org/10.13328/J.CNKI.JOS.004937

zbMATH Keywords

differential evolutiondynamic programmingparticle swarm optimizationrepair approachtime complexity

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Algorithms for randomized time-varying knapsack problems
• Randomized time-varying knapsack problems via binary beetle antennae search algorithm: emphasis on applications in portfolio insurance
• Evolutionary algorithms for knapsack problems
• Exact solution of the robust knapsack problem
• Exact algorithms for the 0-1 time-bomb knapsack problem

Cited in

(4)

• Exact algorithms for the 0-1 time-bomb knapsack problem
• Randomized time-varying knapsack problems via binary beetle antennae search algorithm: emphasis on applications in portfolio insurance
• Runtime analysis of the (1 + 1) evolutionary algorithm for the chance-constrained knapsack problem
• Algorithms for randomized time-varying knapsack problems

This page was built for publication: Exact algorithms and evolutionary algorithms for randomized time-varying knapsack problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5368630)