A unified approach and a summary of the most important results concerned with exact
methods for solving the (binary) knapsack problem and its generalizations are given. We …

In this paper we present the steganographic approach to peer-to-peer systems with a
modified algorithm. This gives the user a very high level of protection against being …

1 Introduction Page 1 Advanced Mathematical Models & Applications Vol.3, No.3, 2018, pp.179-191
PRACTICAL ASPECTS OF SOLVING COMBINATORIAL OPTIMIZATION PROBLEMS Urfat …

In this study one-dimensional knapsack problems (KP), which have many applications in
technical and economic areas, are studied; then greedy algorithms are discussed for these …

In this work, a new hybrid heuristic algorithm for the 0/1 multidimensional knapsack problem
is proposed. In the algorithm, Lagrange multipliers for every constraint are determined to …

Abstract The Boolean Knapsack Problem, which has numerous real life applications, is a
combinatorial optimization problem. Since the problem belongs to NP-Hard, many …

In this study, a mathematical model for planning of measures taken to improve road safety by
using Qualimetry methods was developed. The problem was modelled as One-Dimensional …

OPTIMAL LOCATION OF RESERVING FILES IN DISTRIBUTED COMPUTER SYSTEMS 1.
Introduction One of the important aspects in the design o Page 1 Appl. Comput. Math. 1 (2002) …

ON THE SOLUTION OF MULTIDIMENSIONAL INTEGER KNAPSACK PROBLEM WITH
DYNAMIC PROGRAMMING TECHNIQUE Page 302 ON THE SOLUTION OF …

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 …