Results 191 to 200 of about 28,713 (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
Knapsack problems — An overview of recent advances. Part I: Single knapsack problems
Computers and Operations Research, 2022Valentina Cacchiani +2 more
exaly
Group theory-based optimization algorithm for solving knapsack problems
Knowledge-Based Systems, 2021He Yichao, Xi-Zhao Wang
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
Novel binary differential evolution algorithm for knapsack problems
Information Sciences, 2021Ismail M Ali +2 more
exaly
Canonical Duality Theory and Algorithm for Solving Bilevel Knapsack Problems With Applications
IEEE Transactions on Systems, Man, and Cybernetics: Systems, 2021David Yang Gao
exaly