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 …

We present a fully polynomial-time approximation scheme (FPTAS) for a very general
version of the well-known knapsack problem. This generalization covers, with few …

With the electrification of transportation, the rising uptake of electric vehicles (EVs) might
stress distribution networks significantly, leaving their performance degraded and stability …

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] …

We study a class of combinatorial scheduling problems characterized by a particular type of
constraint often associated with electrical power or gas energy. This constraint appears in …

This study addresses the scheduling problem of two identical parallel machines with the
objective of minimizing the total completion time under the machine availability constraints …

Binary non-linear programs belong to the class of combinatorial problems which are
computationally hard even to approximate. This paper aims to explore some conditions on …

This Ph. D. thesis deals with two different classes of optimization problems: knapsack
problems and tool switching problems. Knapsack problems became a classical and rich …

Abstract The Unsplittable Flow on a Path (UFP) problem has garnered considerable
attention as a challenging combinatorial optimization problem with notable practical …