An efficient improved group theory-based optimization algorithm with directed mutation operator for the discounted {0–1} knapsack problem

International Journal of Machine Learning and Cybernetics 2026

View at publisher
Authors: Hansong Zhang, Yichao He, Jinghong Wang, Bianfang Chai, Seyedali Mirjalili
DOI: 10.1007/s13042-025-02970-w
Cited by: 0
References: 27

Fields of Study & Subjects

Metaheuristic Optimization Algorithms Research Optimization and Packing Problems Scheduling and Timetabling Solutions

Publication details

Journal / source
International Journal of Machine Learning and Cybernetics
Volume
17
Issue
3
Publication date
16 February 2026
Language
EN