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
Integer 1/0 Knapsack Problem Dynamic Programming Approach in Building Maintenance Optimization
International Journal of Science and Applied Science: Conference Series, 2017 The most common problem in urban areas is the high public demand and the limited provision of housing. In meeting the needs of affordable housing for low income communities, the Government of Indonesia implements Rusunawa Project. Object of this research
Viska Dewi Fawzy +2 more
doaj +1 more source
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
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
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
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
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
The Knapsack Problem with Conflict Graphs
Journal of Graph Algorithms and Applications, 2009 We extend the classical 0-1 knapsack problem by introducing disjunctive constraints for pairs of items which are not allowed to be packed together into the knapsack. These constraints are represented by edges of a conflict graph whose vertices correspond
Ulrich Pferschy, Joachim Schauer
doaj +1 more source
The Minmax Multidimensional Knapsack Problem with Application to a Chance-Constrained Problem [PDF]
, 2007 In this paper we present a new combinatorial problem, called minmax multidimensional knapsack problem (MKP), motivated by a military logistics problem. The logistics problem is a two-period, two-level, chanced-constrained problem with recourse.
Polukarov, Maria +2 more
core +2 more sources