English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The disjunctively constrained knapsack problem consists in packing a subsetof pairwisely compatible items in a capacity-constrained knapsack such that thetotal profit of the selected items is maximized while satisfying the knapsackcapacity. DCKP has numerous applications and is however computationallychallenging (NP-hard). In this work, we present a threshold search basedmemetic algorithm for solving the DCKP that combines the memetic framework withthreshold search to find high quality solutions. Extensive computationalassessments on two sets of 6340 benchmark instances in the literaturedemonstrate that the proposed algorithm is highly competitive compared to thestate-of-the-art methods. In particular, we report 24 and 354 improvedbest-known results (new lower bounds) for Set I (100 instances) and for Set II(6240 instances), respectively. We analyze the key algorithmic components andshed lights on their roles for the performance of the algorithm. The code ofour algorithm will be made publicly available.

A threshold search based memetic algorithm for the disjunctively constrained knapsack problem