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
Showing math.COShow all

1 paper · 1 filter

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.