Single- and multi-objective evolutionary algorithms for the knapsack problem with dynamically changing constraints

DOI10.1016/j.tcs.2022.05.008OpenAlexW4280569079MaRDI QIDQ2672647

Vahid Roostapour, Frank Neumann, Aneta Neumann

Publication date: 13 June 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2004.12574

zbMATH Keywords

combinatorial optimizationknapsack problemdynamic constraints

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Uses Software

• SPEA2
• jMetal

Cites Work

• Unnamed Item
• Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
• Minimum spanning trees made easier via multi-objective optimization
• Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints
• Fixed-parameter evolutionary algorithms and the vertex cover problem
• Correction to: ``Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints
• Evolutionary Learning: Advances in Theories and Algorithms
• Introduction to evolutionary computing

This page was built for publication: Single- and multi-objective evolutionary algorithms for the knapsack problem with dynamically changing constraints