Results 191 to 200 of about 33,818 (220)
Some of the next articles are maybe not open access.
Core Problems in Knapsack Algorithms
Operations Research, 1999Since Balas and Zemel in the 1980s introduced the so-called core problem as an efficient tool for solving the Knapsack Problem, all the most successful algorithms have applied this concept. Balas and Zemel proved that if the weights in the core are uniformly distributed then there is a high probability for finding an optimal solution in the core ...
openaire +2 more sources
On Parallel Computation for the Knapsack Problem
Journal of the ACM, 1982We are interested in the complexity of solving the knapsack problem with n input real numbers on a parallel computer with real arithmetic and branching operations. A processor-time tradeoff constraint is derived; in particular, it is shown that an exponential number of processors have to be used if the problem is to be solved in time $t \le {\sqrt{n ...
openaire +1 more source
A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts
European Journal of Operational Research, 2021Stefano Coniglio +2 more
exaly
1991
The binary knapsack is one of the most important problems in discrete programming. It has many practical applications, discussed in Section 1.5, and often appears as a subproblem in the analysis and solving of more complicated problems. Although it is.N P-hard, i.e., the difficulty of solving the knapsack problem is, generally speaking, the same as the
openaire +1 more source
The binary knapsack is one of the most important problems in discrete programming. It has many practical applications, discussed in Section 1.5, and often appears as a subproblem in the analysis and solving of more complicated problems. Although it is.N P-hard, i.e., the difficulty of solving the knapsack problem is, generally speaking, the same as the
openaire +1 more source
Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
Management Science, 1999Silvano Martello, David Pisinger
exaly
A minimal algorithm for the multiple-choice knapsack problem
European Journal of Operational Research, 1995David Pisinger
exaly