4 citations · 5 across the 9 of their papers we have counts for
11 papers
Avoiding Deadlocks via Weak Deadlock Sets
Gianpaolo Oriolo, Anna Russo Russo
A deadlock occurs in a network when two or more items prevent each other from moving and are stalled. In a general model, items are stored at vertices and each vertex has a buf…
Optimization for Evaluating the Practical Capacity of a Transshipment Yard
Anna Russo Russo, Roberto Mancini, Gianpaolo Oriolo +2
In order to increase rail freight transportation in Italy, Rete Ferroviaria Italiana (RFI) the Italian railway infrastructure manager, is carrying out several investment plans to e…
On the Nucleolus of a Class of Linear Production Games
Mourad Baïou, Gianpaolo Oriolo, Gautier Stauffer
We study the nucleolus in a class of cooperative games where agents collaborate by sharing demands and production-distribution capacities across multiple markets. These production-…
Rerouting flows when links fail
Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo
We introduce and investigate reroutable flows, a robust version of network flows in which link failures can be mitigated by rerouting the affected flow. Given a capacitated network…
Protection of flows under targeted attacks
Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo +2
Due to the importance of robustness in many real-world optimization problems, the field of robust optimization has gained a lot of attention over the past decade. We concentrate on…
The Online Replacement Path Problem
David Adjiashvili, Marco Senatore
We study a natural online variant of the replacement path problem. The \textit{replacement path problem} asks to find for a given graph , two designated vertices $s,t\in…