A novel binary Kepler optimization algorithm for 0–1 knapsack problems: Methods and applications
Alexandria Engineering Journal, 2023 The 0–1 Knapsack problem is a non-deterministic polynomial-time-hard combinatorial optimization problem that cannot be solved in reasonable time using traditional methods.
Mohamed Abdel-Basset +5 more
doaj +1 more source
The RaPID-Ω system: Room and proctor intelligent decider for large scale tests programming [PDF]
Yugoslav Journal of Operations Research, 2021 We present the documentation and mathematical modeling of the open-box system RaPID/Ω. The software is designed for the choice of classrooms and the assignment of proctoring duties in massive tests, which is a common situation in educational institutions
Morales Fernando A.
doaj +1 more source
Time-constrained restless bandits and the knapsack problem for perishable items (Extended Abstract) [PDF]
, 2007 Motivated by a food promotion problem, we introduce the Knapsack Problem for Perishable Items (KPPI) to address a dynamic problem of optimally filling a knapsack with items that disappear randomly.
Jacko, Peter, Niño-Mora, José
core +1 more source
Binary Moth Search Algorithm for Discounted {0-1} Knapsack Problem
IEEE Access, 2018 The discounted {0-1} knapsack problem (DKP) extends the classical 0-1 knapsack problem (0-1 KP) in which a set of item groups is included and each group consists of three items, whereas at most one of the three items can be packed into the knapsack ...
Yan-Hong Feng, Gai-Ge Wang
doaj +1 more source
Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack [PDF]
, 2019 The area of parameterized approximation seeks to combine approximation and parameterized algorithms to obtain, e.g., (1+epsilon)-approximations in f(k,epsilon)n^O(1) time where k is some parameter of the input.
Grandoni, Fabrizio +2 more
core +2 more sources
A Memetic Lagrangian Heuristic for the 0-1 Multidimensional Knapsack Problem
Discrete Dynamics in Nature and Society, 2013 We present a new evolutionary algorithm to solve the 0-1 multidimensional knapsack problem. We tackle the problem using duality concept, differently from traditional approaches. Our method is based on Lagrangian relaxation.
Yourim Yoon, Yong-Hyuk Kim
doaj +1 more source
Multi-Objective ABC-NM Algorithm for Multi-Dimensional Combinatorial Optimization Problem
Axioms, 2023 This article addresses the problem of converting a single-objective combinatorial problem into a multi-objective one using the Pareto front approach. Although existing algorithms can identify the optimal solution in a multi-objective space, they fail to ...
Muniyan Rajeswari +5 more
doaj +1 more source
An Exact Algorithm for Bilevel 0‐1 Knapsack Problems [PDF]
Mathematical Problems in Engineering, 2012 We propose a new exact method for solving bilevel 0‐1 knapsack problems. A bilevel problem models a hierarchical decision process that involves two decision makers called the leader and the follower. In these processes, the leader takes his decision by considering explicitly the reaction of the follower.
Mansi, Raid +3 more
openaire +3 more sources
Binary light spectrum optimizer for knapsack problems: An improved model
Alexandria Engineering Journal, 2023 This paper presents a binary variant of a novel physics-based meta-heuristic optimization algorithm, namely Light spectrum optimizer (LSO), for tackling both the 0–1 knapsack (KP01) and multidimensional knapsack problems (MKP).
Mohamed Abdel-Basset +5 more
doaj +1 more source
Solving Multidimensional 0-1 Knapsack Problem with Time-Free Tissue P Systems
Journal of Applied Mathematics, 2014 Tissue P system is a class of parallel and distributed model; a feature of traditional tissue P system is that the execution time of certain biological processes is very sensitive to environmental factors that might be hard to control.
Xiangrong Liu +5 more
doaj +1 more source