Results 21 to 30 of about 25,976 (248)
Tolerance analysis for 0–1 knapsack problems [PDF]
European Journal of Operational Research, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
David Pisinger, Alima Saidi
openaire +3 more sources
Reoptimizing the 0–1 knapsack problem
Discrete Applied Mathematics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
ARCHETTI, Claudia +2 more
openaire +4 more sources
Novel Discrete Differential Evolution Algorithm for Solving D{0-1}KP Problem [PDF]
Jisuanji kexue yu tansuo, 2022 The discounted {0-1} knapsack problem (D{0-1}KP) is a more complex variant of the classic 0-1 knap-sack problem (0-1KP). In order to efficiently solve the D{0-1}KP by using discrete differential evolution algorithm, firstly, a novel V-shape transfer ...
ZHANG Fazhan, HE Yichao, LIU Xuejing, WANG Zekun
doaj +1 more source
A Thermodynamical Selection-Based Discrete Differential Evolution for the 0-1 Knapsack Problem
Entropy, 2014 Many problems in business and engineering can be modeled as 0-1 knapsack problems. However, the 0-1 knapsack problem is one of the classical NP-hard problems.
Zhaolu Guo +4 more
doaj +1 more source
Regarding the failure of applying the conventional 2-approximation algorithm to the collapsing knapsack problem [PDF]
, 2014 We show that the conventional 2-approximation algorithm for the classical 0?1 knapsack problem does not work for the collapsing knapsack problem in general.
Iida Hiroshi
core +1 more source
IEEE Access, 2019 The 0-1 knapsack problem is a typical discrete combinatorial optimization problem with numerous applications. In this paper, a binary multi-scale quantum harmonic oscillator algorithm (BMQHOA) with genetic operator is proposed for solving 0-1 knapsack ...
Yan Huang +4 more
doaj +1 more source
Adaptation of a Mosquito Swarm Algorithm to Solve a Binary Knapsack Problem [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2018 The paper tackled one of the artificial intelligence algorithms which is Mosquito swarm algorithm as a nature inspired algorithms, to solve 0-1 knapsack an optimization problem through adaptation steps of a Mosquito swarm algorithm and the inspiration ...
Ruqaya Sha’ban, Isra Alkallak
doaj +1 more source
Optimizing over the efficient set of the binary bi-objective knapsack problem [PDF]
Yugoslav Journal of Operations Research, 2023 This paper deals with the problem of optimizing a linear function over the efficient set of a 0-1 bi-objective knapsack problem. Such a function represents the main criterion of the problem posed.
Chaabane Djamal, Lachemi Nadia
doaj +1 more source
A Rough Sets based modified Scatter Search algorithm for solving 0-1 Knapsack problem [PDF]
Decision Science Letters, 2015 This paper presents a new search methodology for different sizes of 0-1 Knapsack Problem (KP). The proposed methodology uses a modified scatter search as a meta-heuristic algorithm.
Hassan Rezazadeh
doaj +1 more source
Lower Bounds for the Average and Smoothed Number of Pareto Optima [PDF]
, 2011 Smoothed analysis of multiobjective 0-1 linear optimization has drawn considerable attention recently. The number of Pareto-optimal solutions (i.e., solutions with the property that no other solution is at least as good in all the coordinates and better ...
Goyal, Navin, Rademacher, Luis
core +2 more sources