0-1 knapsack problem - Open Access .click

Results 181 to 190 of about 24,926 (205)

Some of the next articles are maybe not open access.

Genetic algorithms for the 0/1 knapsack problem

1994
In this paper the utility of several constraint-handling techniques is investigated on the basis of a family of 0/1 knapsack problems. Several evolutionary algorithms are applied to this NP-hard problem. The conclusions might be applicable to many constrained combinatorial optimization problems, for which the use of evolutionary algorithm is considered.
Zbigniew Michalewicz, Jarosław Arabas
openaire +1 more source

Testable heuristics for the 0?1 knapsack problem

Cybernetics, 1991
Two kinds of heuristics, fixed time and cut time, are proposed in order to use the running time available in solving 0–1 knapsack problems profitably.
openaire +1 more source

Local Cuts for 0–1 Multidimensional Knapsack Problems

2017
This paper investigates the local cuts approach for the multidimensional knapsack problem (MKP) which has more than one knapsack constraints. The implementation of the local cuts-based cutting plane algorithm is an extension of the exact knapsack separation scheme of Vasilyev et al. (J Glob Optim 1–24, [13]). Comparisons are made with the global lifted
openaire +1 more source

A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts

European Journal of Operational Research, 2021
Stefano Coniglio +2 more
exaly

Heuristics for the 0-1 min-knapsack problem