12 citations · 12 across the 2 of their papers we have counts for
2 papers
cs.DS2020
Expected Performance and Worst Case Scenario Analysis of the Divide-and-Conquer Method for the 0-1 Knapsack Problem
Fernando A Morales, Jairo A Martínez
In this paper we furnish quality certificates for the Divide-and-Conquer method solving the 0-1 Knapsack Problem: the worst case scenario and estimates for the expected performance…
cs.DM2019★ 12 cited
Analysis of Divide & Conquer strategies for the 0-1 Minimization Knapsack Problem
Fernando A Morales, Jairo A Martínez
We introduce and asses several Divide \& Conquer heuristic strategies aimed to solve large instances of the 0-1 Minimization Knapsack Problem. The method subdivides a large problem…