A new class of hard problem instances for the 0-1 knapsack problem
Year of publication: |
2022
|
---|---|
Authors: | Jooken, Jorik ; Leyman, Pieter ; De Causmaecker, Patrick |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 301.2022, 3 (16.9.), p. 841-854
|
Subject: | Combinatorial optimization | 0-1 knapsack problem | Problem instance hardness | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem |
-
Jooken, Jorik, (2023)
-
Adaptive perturbed neighbourhood search for the expanding capacity multiple-choice knapsack problem
Sbihi, A., (2013)
-
Heuristic concentration and tabu search : a nose to nose comparison
Rosing, K. E., (1997)
- More ...
-
Features for the 0-1 knapsack problem based on inclusionwise maximal solutions
Jooken, Jorik, (2023)
-
Jooken, Jorik, (2023)
-
Evolving test instances of the Hamiltonian completion problem
Lechien, Thibault, (2023)
- More ...