Benckmark inctances of the disjunctively constrained knapsack problem (DCKP)

Published: 16 April 2021| Version 1 | DOI: 10.17632/gb5hhjkygd.1
Contributors:
Zequn Wei,

Description

This dataset includes the 6340 benchmark instances of the disjunctively constrained knapsack problem (DCKP). The first set I of 100 instances was introduced in [1] and [2]. The second set II of 6240 instances was introduced in [3] and expanded in [4]. We would like to thank these authors and co-authors for sharing the instances of the DCKP. [1] M. Hifi, M. Michrafy, A reactive local search-based algorithm for the disjunctively constrained knapsack problem, Journal of the Operational Research Society 57 (6) (2006) 718-726. [2] Z. Quan, L. Wu, Cooperative parallel adaptive neighbourhood search for the disjunctively constrained knapsack problem, Engineering Optimization 49 (9) 636 (2017) 1541-1557. [3] A. Bettinelli, V. Cacchiani, E. Malaguti, A branch-and-bound algorithm for the knapsack problem with conflict graph, INFORMS Journal on Computing 29 (3) (2017) 457-473. [4] S. Coniglio, F. Furini, P. San Segundo, A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts, European Journal of Operational Research 289 (2) (2021) 435-455.

Files

Categories

Benchmarking

License