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

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

collaborators

10 papers

math.OC2023

ITERATED INSIDE OUT: a new exact algorithm for the transportation problem

Roberto Bargetto, Federico Della Croce, Rosario Scatamacchia

We propose a novel exact algorithm for the transportation problem, one of the paradigmatic network optimization problems. The algorithm, denoted Iterated Inside Out, requires in in…

math.OC2021

The ZERO Regrets Algorithm: Optimizing over Pure Nash Equilibria via Integer Programming

Gabriele Dragotto, Rosario Scatamacchia

Designing efficient algorithms to compute Nash equilibria poses considerable challenges in Algorithmic Game Theory and Optimization. In this work, we employ integer programming tec…

cs.DS2020

The Baggage Belt Assignment Problem

David Pisinger, Rosario Scatamacchia

We consider the problem of assigning flights to baggage belts in the baggage reclaim area of an airport. The problem is originated by a real-life application in Copenhagen airport.…

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…

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.DS2018

The Stochastic Critical Node Problem over Trees

Pierre Hosteins, Rosario Scatamacchia

We tackle a stochastic version of the Critical Node Problem (CNP) where the goal is to minimize the pairwise connectivity of a graph by attacking a subset of its nodes. In the stoc…