Results 181 to 190 of about 28,490 (215)
Some of the next articles are maybe not open access.
Group theory-based optimization algorithm for solving knapsack problems
Knowledge-Based Systems, 2021Xi-Zhao Wang
exaly
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
Proceedings of the 9th international conference on Supercomputing - ICS '95, 1995
D. Morales +4 more
openaire +1 more source
D. Morales +4 more
openaire +1 more source
Shuffled frog leaping algorithm and its application to 0/1 knapsack problem
Applied Soft Computing Journal, 2014Kaushik Kumar Bhattacharjee
exaly
Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
Management Science, 1999Silvano Martello, David Pisinger
exaly
Solving 0–1 knapsack problem by a novel global harmony search algorithm
Applied Soft Computing Journal, 2011Steven Li
exaly