A rough sets based modified scatter search algorithm for solving 0-1 knapsack problem
H Rezazadeh - Decision Science Letters, 2015 - growingscience.com
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 …
(KP). The proposed methodology uses a modified scatter search as a meta-heuristic …
A new effective dynamic program for an investment optimization problem
After a series of publications of TE O'Neil et al.(eg in 2010), dynamic programming seems to
be the most promising way to solve knapsack problems. Some techniques are known to …
be the most promising way to solve knapsack problems. Some techniques are known to …
[PDF][PDF] PRACTICAL ASPECTS OF SOLVING COMBINATORIAL OPTIMIZATION PROBLEMS.
U Nuriyev, F Nuriyeva - Advanced Mathematical Models & …, 2018 - jomardpublishing.com
1 Introduction Page 1 Advanced Mathematical Models & Applications Vol.3, No.3, 2018, pp.179-191
PRACTICAL ASPECTS OF SOLVING COMBINATORIAL OPTIMIZATION PROBLEMS Urfat …
PRACTICAL ASPECTS OF SOLVING COMBINATORIAL OPTIMIZATION PROBLEMS Urfat …
Complementary Problems for Subset-Sum and Change Making Problems
A Guler, U Nurıyev - Advances in Computational Science, Engineering and …, 2013 - Springer
Abstract In this study, Change Making Problem (CMP) and Subset-Sum Problem (SSP),
which can arise, in practice, in some classes of one dimensional cargo loading and cutting …
which can arise, in practice, in some classes of one dimensional cargo loading and cutting …