The Knapsack Problem with forfeit sets
| Year of publication: |
2023
|
|---|---|
| Authors: | D'Ambrosio, Ciriaco ; Laureana, Federica ; Raiconi, Andrea ; Vitale, Gaetano |
| Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 151.2023, p. 1-13
|
| Subject: | Knapsack Problem | Conflicts | Forfeit sets | Carousel Greedy | Memetic algorithm | Hybrid metaheuristic | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Heuristik | Heuristics | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Evolutionärer Algorithmus | Evolutionary algorithm |
-
A memetic algorithm to pack unequal circles into a square
Zeng, Zhi-Zhong, (2018)
-
Exact and approximate methods for the score-constrained packing problem
Hawa, Asyl L., (2022)
-
Hosseinzadeh, Mohammad Reza, (2022)
- More ...
-
Carrabs, Francesco, (2017)
-
Maximizing lifetime in wireless sensor networks with multiple sensor families
Carrabs, Francesco, (2015)
-
An improved heuristic approach for the interval immune transportation problem
Carrabs, Francesco, (2021)
- More ...