9 citations · 23 across the 9 of their papers we have counts for
10 papers
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…
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…
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.
Merging Combinatorial Design and Optimization: the Oberwolfach Problem
Fabio Salassa, Gabriele Dragotto, Tommaso Traetta +2
The Oberwolfach Problem -- posed by Gerhard Ringel in 1967 -- is a paradigmatic Combinatorial Design problem asking whether the complete graph decomposes into edge-di…
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…
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…
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…
MILP and Max-Clique based heuristics for the Eternity II puzzle
Fabio Salassa, Wim Vancroonenburg, Tony Wauters +2
The present paper considers a hybrid local search approach to the Eternity II puzzle and to unsigned, rectangular, edge matching puzzles in general. Both an original mixed-integer…
No-idle, no-wait: when shop scheduling meets dominoes, eulerian and hamiltonian paths
Jean-Charles Billaut, Federico Della Croce, Fabio Salassa +1
In shop scheduling, several applications exist where it is required that some components perform consecutively. We refer to no-idle schedules if machines are required to operate wi…
Dynamic programming algorithms, efficient solution of the LP-relaxation and approximation schemes for the Penalized Knapsack Problem
Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia
We consider the 0-1 Penalized Knapsack Problem (PKP). Each item has a profit, a weight and a penalty and the goal is to maximize the sum of the profits minus the greatest penalty v…