We study pseudo-polynomial time algorithms for the fundamental 0-1 Knapsack problem.
Recent research interest has focused on its fine-grained complexity with respect to the …

In recent years, significant progress has been made in explaining the apparent hardness of
improving upon the naive solutions for many fundamental polynomially solvable problems …

We investigate pseudopolynomial-time algorithms for Bounded Knapsack and Bounded
Subset Sum. Recent years have seen a growing interest in settling their fine-grained …

Knapsack and Partition are two important additive problems whose fine-grained
complexities in the (1—ε)-approximation setting are not yet settled. In this work, we make …

We present new exact and approximation algorithms for 0-1-Knapsack and Unbounded
Knapsack:* Exact Algorithm for 0-1-Knapsack: 0-1-Knapsack has known algorithms running …

Beginnen wir mit zwei Beispielen. Eine Firma betreibt eine Maschine, mit der Löcher in
Leiterplatten gebohrt werden. Da sie viele dieser Platinen herstellt, möchte sie erreichen …

The 0–1 knapsack problem is an important optimization problem, because it arises as a
special case of a wide variety of optimization problems and has been generalized in several …

For multiobjective optimization problems, it is meaningful to compute a set of solutions
covering all possible trade-offs between the different objectives. The multiobjective …

Knapsack and Subset Sum are fundamental NP-hard problems in combinatorial
optimization. Recently there has been a growing interest in understanding the best possible …

Given a set of n positive integers and a knapsack of capacity c, the Subset-Sum Problem is
to find a subset the sum of which is closest to c without exceeding the value c. In this paper …