We study the classical 0–1 knapsack problem with additional restrictions on pairs of items. A
conflict constraint states that from a certain pair of items at most one item can be contained in …

This article investigates a new robust criterion for the vehicle routing problem with
uncertainty on the travel time. The objective of the proposed criterion is to find a robust …

Optimizing resource allocation often requires a trade-off between multiple objectives. Since
projects must be fully implemented or not at all, this issue is modeled as an integer …

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

We investigate the use of a parallel computing model for solving the disjunctively
constrained knapsack problem. This parallel approach is based on a multi‐neighborhood …

This article investigates the use of parallel computing for solving the disjunctively
constrained knapsack problem. The proposed parallel computing model can be viewed as a …

The paper focuses on studying a class KCFG of a Constrained Knapsack Problem (CKP),
where conflict and forcing constraints are present. Four KCFG-formulations as quadratically …

Carnes and Shmoys [2] presented a 2-approximation algorithm for the minimum knapsack
problem. We extend their algorithm to the minimum knapsack problem with a forcing graph …

The use of neighborhood search techniques to address a practical issue faced by
agricultural investors is examined in this study. The problem is named as agricultural land …

This thesis considers two generalized knapsack problems: the set-union knap-sack problem
(SUKP) and the disjunctively constrained knapsack problem (DCKP). These two problems …