An effective hybrid search method for the quadratic knapsack problem with conflict graphs
Year of publication: |
2024
|
---|---|
Authors: | Zhou, Qing ; Hao, Jin-Kao ; Jiang, Zhong-Zhong ; Wu, Qinghua |
Published in: |
Journal of the Operational Research Society. - London : Taylor and Francis, ISSN 1476-9360, ZDB-ID 2007775-0. - Vol. 75.2024, 5, p. 1000-1010
|
Subject: | conflict graphs | heuristics | memetic framework | Quadratic knapsack problem | tabu search | Heuristik | Heuristics | Graphentheorie | Graph theory | Ganzzahlige Optimierung | Integer programming | Mathematische Optimierung | Mathematical programming | Operations Research | Operations research |
-
Optimal capacitated ring trees
Hill, Alessandro, (2016)
-
Bounds and heuristic algorithms for the bin packing problem with minimum color fragmentation
Barkel, Mathijs, (2025)
-
An iterated "hyperplane exploration" approach for the quadratic knapsack problem
Chen, Yuning, (2017)
- More ...
-
Adaptive feasible and infeasible evolutionary search for the knapsack problem with forfeits
Zhou, Qing, (2025)
-
A hybrid evolutionary search for the generalized quadratic multiple knapsack problem
Zhou, Qing, (2022)
-
An efficient iterated local search for the minimum quasi-clique partitioning problem
Zhou, Qing, (2025)
- More ...