Results 221 to 230 of about 25,976 (248)
Some of the next articles are maybe not open access.
Heuristics for the 0-1 min-knapsack problem
Acta Cybern., 1990no ...
Csirik, János +3 more
openaire +5 more sources
A New Approach for Solving 0/1 Knapsack Problem
2006 IEEE International Conference on Systems, Man and Cybernetics, 2006In this paper, we reported our study on solving 0/1 knapsack problem effectively by using ant colony optimization. The 0/1 knapsack problem is to maximize the total profit under the constraint that the total weight of all chosen objects is at the most weight limit.
Chou-Yuan Lee +2 more
openaire +1 more source
Solving the 0–1 proportional knapsack problem by sampling
Journal of Optimization Theory and Applications, 1994zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Penn, M., Hasson, D., Avriel, M.
openaire +1 more source
An Improved Heuristic for Multidimensional 0—1 Knapsack Problems
Journal of the Operational Research Society, 1990For the multidimensional 0-1 knapsack problem a heuristic exists, based on Lagrange multipliers, that also enables the determination of an upper bound to the optimal criterion value. This heuristic is extended in two ways: (1) in each step, not one, but more multiplier values are computed simultaneously, and (2) at the end the upper bound is sharpened ...
A. Volgenant, J. A. Zoon
openaire +1 more source
Resolution of the 0–1 knapsack problem: Comparison of methods
Mathematical Programming, 1975A method of solving the 0–1 knapsack problem which derives from the “shrinking boundary method” is described and compared to other methods through extensive computational experimentation.
Didier Fayard, Gérard Plateau
openaire +1 more source
On The Generalized Fuzzy Multiconstraint 0-1 Knapsack Problem
2006 IEEE International Conference on Fuzzy Systems, 2006This paper investigates multiconstraint 0-1 knapsack problems (MCKP) in which all of the weight coefficients are fuzzy numbers. This study is based on the assumption that each weight coefficient is imprecise due to the use of decimal truncation or rough estimation of the coefficients by the decision-maker.
openaire +1 more source
The 0–1 knapsack problem with multiple choice constraints
European Journal of Operational Research, 1978Abstract In this paper we consider the 0–1 knapsack problem with multiple choice constraints appended. Such a problem may arise in a capital budgeting context where only one project may be selected from a particular group of projects. Thus the problem is to choose one project from each group such that the budgetary constraint is satisfied and the ...
openaire +2 more sources
A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts
European Journal of Operational Research, 2021Stefano Coniglio +2 more
exaly
On the adoption of Metaheuristics for Solving 0–1 Knapsack Problems
2021 12th International Symposium on Parallel Architectures, Algorithms and Programming (PAAP), 2021Yang Qiu +3 more
openaire +1 more source
Approximate Algorithms for the 0/1 Knapsack Problem
Journal of the ACM, 1975openaire +2 more sources