most citedAnalysis of Divide & Conquer strategies for the 0-1 Minimization Knapsack Problem

12 citations · 12 across the 2 of their papers we have counts for

collaborators
Showing cs.DSShow all

1 paper · 1 filter

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…