Features for the 0-1 knapsack problem based on inclusionwise maximal solutions
Year of publication: |
2023
|
---|---|
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. 311.2023, 1 (16.11.), p. 36-55
|
Subject: | Combinatorial optimization | 0-1 knapsack problem | Packing | Prolem instance hardness | Instance space analysis | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming |
-
Revisiting where are the hard knapsack problems? : via instance space analysis
Smith-Miles, Kate, (2021)
-
Instance space analysis for 2D bin packing mathematical models
Liu, Chang, (2024)
-
A new class of hard problem instances for the 0-1 knapsack problem
Jooken, Jorik, (2022)
- More ...
-
A new class of hard problem instances for the 0-1 knapsack problem
Jooken, Jorik, (2022)
-
Jooken, Jorik, (2023)
-
Evolving test instances of the Hamiltonian completion problem
Lechien, Thibault, (2023)
- More ...