After the seminal books by Martello and Toth (1990) and Kellerer, Pferschy, and Pisinger
(2004), knapsack problems became a classical and rich research area in combinatorial …

The knapsack problem arises in a variety of real world applications such as railway stations,
flexible manufacturing systems, multimedia, cryptography and hydrological studies. In this …

This paper deals with the Knapsack Problem with conflicts, also known as the Disjunctively
Constrained Knapsack Problem. The conflicts are represented by a graph whose vertices …

This work deals with the 0–1 knapsack problem in its two-dimensional version considering a
conflict graph, where each edge in this graph represents a pair of items that must not be …

Given a set of items, each with a profit and a weight and a conflict graph describing
incompatibilities between items, the Disjunctively Constrained Knapsack Problem is to …

In this paper, we propose a parallel ant colony optimization based metaheuristic for solving
the maximum-weight clique problem, which is a variation of the maximum clique problem …

The knapsack problem arises in a variety of real world applications, including flexible
manufacturing systems, railway stations, hydrological studies and others. In this paper, we …

Knapsack problems are a highly active research area in combinatorial optimization.
Although, the knapsack problem has been known since over a century, see Mathews [368] …

New information technology constantly improves the efficiency of social networks. Using
optimization and decision models in the context of large data sets attracts extensive …

In this paper, we study the knapsack problem with conflict pair constraints. After a thorough
literature survey on the topic, our study focuses on the special case of bipartite conflict …