This paper proposes a modified iterated greedy algorithm for solving an NP-hard knapsack problem known as the knapsack problem with setup. In contrast to the classical 0-1 knapsack problem, items belong to different classes, and choosing at least one item from a specific class causes a class setup capacity to be consumed and a reduction of the total profit in terms of a penalty that has to be p...

This paper proposes a modified iterated greedy algorithm for solving an NP-hard knapsack problem known as the knapsack problem with setup. In contrast to the classical 0-1 knapsack problem, items belong to different classes, and choosing at least one item from a specific class causes a class setup capacity to be consumed and a reduction of the total profit in terms of a penalty that has to be p...

Confidential algorithm for the approximate graph vertex covering problem is presented in this article. It can preserve privacy of data at every stage computation, which very important context cloud computing. Security of~our solution based on fully homomorphic encryption scheme. The time complexity and security aspects considered are described.

The evolution of digital communications has resulted in new services that require from secure and robust connections. Nowadays, a signal must be transmitted to distant nodes, the quality deteriorates as distance between endpoints increases. Regenerators are special components able restore signal, order increase can travel without losing quality. These very expensive deploy maintain and, for thi...

This paper addresses a complex parallel machine scheduling problem with jobs divided into operations and grouped in families. Non-anticipatory family setup times are held at the beginning of each batch, defined by combination one setup-time sequence from unique family. Other aspects also considered problem, such as release dates for machines, operation’s sizes, machine’s eligibility capacity. W...