Revisiting where are the hard knapsack problems? : via instance space analysis
Year of publication: |
2021
|
---|---|
Authors: | Smith-Miles, Kate ; Christiansen, Jeffrey ; Muñoz, Mario Andrés |
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. 128.2021, p. 1-18
|
Subject: | 0-1 Knapsack problem | Instance Space Analysis | Instance generation | Instance difficulty | Performance evaluation | Algorithm portfolios | Algorithm selection | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming | Algorithmus | Algorithm | Portfolio-Management | Portfolio selection |
-
Instance space analysis for 2D bin packing mathematical models
Liu, Chang, (2024)
-
Weighted superposition attraction algorithm for binary optimization problems
Baykasoğlu, Adil, (2020)
-
A core-based exact algorithm for the multidimensional multiple choice knapsack problem
Mansini, Renata, (2020)
- More ...
-
On the impact of initialisation strategies on Maximum Flow algorithm performance
Alipour, Hossein, (2024)
-
Enhanced instance space analysis for the maximum flow problem
Alipour, Hossein, (2023)
-
Bifidelity surrogate modelling : showcasing the need for new test instances
Andrés-Thió, Nicolau, (2022)
- More ...