2 papers
cs.DS2026
Inclusion-wise extremal knapsack problems are (mostly) hard to approximate
Fabio Ciccarelli, Fabio Furini, Ulrich Pferschy +1
We study two inclusion-wise extremal variants of the 0-1 Knapsack Problem (KP). Given items with integer weights and nonnegative costs or profits, the Minimum-Cost Maximal Knap…
cs.DM2023
Single machine rescheduling for new orders: properties and complexity results
Elena Rener, Fabio Salassa, Vincent T'kindt
Rescheduling problems arise in a variety of situations where a previously planned schedule needs to be adjusted to deal with unforeseen events. A common problem is the arrival of n…