Results 211 to 220 of about 25,976 (248)
Some of the next articles are maybe not open access.
A parallel algorithm for the 0?1 knapsack problem
International Journal of Parallel Programming, 1992Research efforts on parallel exact algorithms for the 0–1 knapsack problem have up to now concentrated on solving small problems (at most 1,000 objects) and in many cases results have only been obtained by simulation of the parallel algorithm. After a brief review of a well known sequential branch-and-bound algorithm we discuss a new parallel algorithm
W. Loots, T. H. C. Smith
openaire +1 more source
A core approach to the 0 –1 equality knapsack problem
Journal of the Operational Research Society, 1998Summary: For the 0-1 knapsack problem with equality constraint a partitioning procedure is introduced which focuses on the core of the problem. The purpose of the procedure is to reduce the required preliminary sorting for large problem instances. Computational results are presented for an improved heuristic as well as for a complete (exact) algorithm ...
Volgenant, A., Marsman, S.
openaire +2 more sources
Problem reduction heuristic for the 0–1 multidimensional knapsack problem
Computers & Operations Research, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Raymond R. Hill +2 more
openaire +2 more sources
Genetic algorithms for the 0/1 knapsack problem
1994In 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, Jaroslaw Arabas
openaire +1 more source
Linear programming for the 0–1 quadratic knapsack problem
European Journal of Operational Research, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Billionnet, Alain, Calmels, Frédéric
openaire +3 more sources
Improved results on the 0–1 multidimensional knapsack problem
European Journal of Operational Research, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michel Vasquez, Yannick Vimont
openaire +1 more source
An Efficient Algorithm for the 0-1 Knapsack Problem
Management Science, 1976In this note we present an efficient algorithm for the 0-1 knapsack problem and announce the availability of a callable FORTRAN subroutine which solves this problem. Computational results show that 50 variable problems can be solved in an average of 4 milliseconds and 200 variable problems in an average of 7 milliseconds on an IBM 360/91.
openaire +2 more sources
Lagrangean methods for the 0–1 Quadratic Knapsack Problem
European Journal of Operational Research, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michelon, Philippe, Veilleux, Louis
openaire +1 more source
Binary Fireworks Algorithm for 0-1 Knapsack Problem
2019 International Conference on Artificial Intelligence and Advanced Manufacturing (AIAM), 2019In this paper, a novel evolutionary algorithm, Binary Fireworks Algorithm (BFWA), is introduced for 0-1 knapsack problem. Firstly, several foundation definitions are proposed, such as binary distance, inversion operator and explosion operator. Besides, BFWA for 0-1 knapsack problem is built by introducing firework explosion, mutation explosion and ...
Junjie Xue, Jiyang Xiao, Jie Zhu
openaire +1 more source
Tackling 0/1 knapsack problem with gene induction
Soft Computing - A Fusion of Foundations, Methodologies and Applications, 2003We propose a gene induction approach for genetic algorithms. It is more robust compared to the traditional approach in genetic algorithms. The approach was applied to 0/1 knapsack problem. It found near optimal results in all the representative problem instances reported in the literature, while traditional approaches failed in a number of instances ...
A. K. Bhatia, Sandip K. Basu
openaire +1 more source