activity
20172020
most citedDynamic programming algorithms, efficient solution of the LP-relaxation and approximation schemes for the Penalized Knapsack Problem

2 citations · 3 across the 5 of their papers we have counts for

collaborators

9 papers

cs.DS2020

An improved solution approach for the Budget constrained Fuel Treatment Scheduling problem

Federico Della Croce, Marco Ghirardi, Rosario Scatamacchia

This paper considers the budget constrained fuel treatment scheduling (BFTS) problem where, in the context of wildfire mitigation, the goal is to inhibit the potential of fire spre…

cs.DS2020

An enhanced pinwheel algorithm for the bamboo garden trimming problem

Federico Della Croce

In the Bamboo Garden Trimming Problem (BGT), there is a garden populated by n bamboos b(1), b(2), ... , b(n)$ with daily growth rates h(1) >= h(2) >= ... >= h(n). We assume that th…

math.CO2019

A solution to a Partitioned Balanced Tournament Design of side 11

Federico Della Croce, Gabriele Dragotto, Fabio Salassa

We provide a solution to the Partitioned Balanced Tournament Design of side . The solution has been generated by exploiting combinatorial optimization methods.

physics.soc-ph2019

Introducing Fairness and Diversification in WTA and ATP Tennis Tournaments Generation

Federico Della Croce, Gabriele Dragotto, Rosario Scatamacchia

Single-elimination tournaments are the standard paradigm both for the main tennis professional associations. Schedules are generated by allocating first seeded and then unseeded pl…

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…