Analysis of Divide-and-Conquer strategies for the 0–1 minimization knapsack problem
Sign Up to like & getrecommendations! Published in 2020 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-020-00584-2
Abstract: We introduce and asses several Divide-and-Conquer heuristic strategies, aimed at solving large instances of the 0–1 Minimization Knapsack Problem. The method subdivides a large problem in two smaller ones (or recursive iterations of the same… read more here.
Keywords: minimization knapsack; divide conquer; problem; knapsack problem ... See more keywords