Branch and solve strategies-based algorithm for the quadratic multiple knapsack problem
Year of publication: |
2022
|
---|---|
Authors: | Aïder, Méziane ; Gacem, Oussama ; Hifi, Mhand |
Published in: |
Journal of the Operational Research Society. - London : Taylor and Francis, ISSN 1476-9360, ZDB-ID 2007775-0. - Vol. 73.2022, 3, p. 540-557
|
Subject: | combinatorial optimisation | Heuristics | integer programming | Ganzzahlige Optimierung | Integer programming | Heuristik | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Algorithmus | Algorithm | Scheduling-Verfahren | Scheduling problem | Branch-and-Bound | Branch and Bound |
-
The parallel stack loading problem of minimizing the exact number of relocations
Tanaka, Shunji, (2024)
-
Hammoudan, Zakaria, (2016)
-
Machine learning for combinatorial optimization : a methodological tour d'horizon
Bengio, Yoshua, (2021)
- More ...
-
Asli, Larbi, (2019)
-
Beam search-based algorithms for the circular packing problem.
Akeb, Hakim, (2007)
-
An exact algorithm for the multiple-choice multidimensional knapsack problem.
Hifi, Mhand, (2004)
- More ...