Expected Performance and Worst Case Scenario Analysis of the Divide-and-Conquer Method for the 0-1 Knapsack Problem

TL;DR

This paper provides theoretical analysis and empirical validation of the Divide-and-Conquer method's expected performance and worst-case scenarios for solving the 0-1 Knapsack Problem, including probabilistic estimates and numerical experiments.

Contribution

It introduces probabilistic analysis and performance estimates for the Divide-and-Conquer approach to the 0-1 Knapsack Problem, with rigorous theoretical and experimental validation.

Findings

Derived analytic estimates for expected performance.

Provided worst-case scenario analysis.

Validated results with numerical experiments.

Abstract

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. The probabilistic setting is given and the main random variables are defined for the analysis of the expected performance. The efficiency is rigorously approximated for one iteration of the method then, these values are used to derive analytic estimates for the performance of a general Divide-and-Conquer tree. All the theoretical results are verified with statistically suited numerical experiments for a wider illustration of the method.