2 citations · 3 across the 5 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.GT2018
A new exact approach for the Bilevel Knapsack with Interdiction Constraints
Federico Della Croce, Rosario Scatamacchia
We consider the Bilevel Knapsack with Interdiction Constraints, an extension of the classic 0-1 knapsack problem formulated as a Stackelberg game with two agents, a leader and a fo…
cs.DS2018
Longest Processing Time rule for identical parallel machines revisited
Federico Della Croce, Rosario Scatamacchia
We consider the Pm || Cmax scheduling problem where the goal is to schedule n jobs on m identical parallel machines to minimize makespan. We revisit the famous Longest Processing T…