| Constructive–destructive heuristics for the Safe Set Problem AB Tomasaz, R Cordone, P Hosteins Computers & Operations Research 159, 106311, 2023 | 8 | 2023 |
| A combinatorial branch and bound for the safe set problem A Boggio Tomasaz, R Cordone, P Hosteins Networks 81 (4), 445-464, 2022 | 7 | 2022 |
| A Revisited Branch and Bound Method for the Weighted Safe Set Problem. AB Tomasaz, R Cordone ICORES, 113-122, 2024 | 3 | 2024 |
| On the completeness of several fortification-interdiction games in the polynomial hierarchy A Boggio Tomasaz, M Carvalho, R Cordone, P Hosteins Mathematics of Operations Research, 2025 | 1 | 2025 |
| Optimisation and Interdiction Problems for Network Safety A BOGGIO TOMASAZ Università degli Studi di Milano, 2024 | 1 | 2024 |
| Complexity Results on the Bi-Level Interdiction Knapsack Problem with Unit Interdiction Costs or Unit Weights A Boggio Tomasaz, M Carvalho, R Cordone, P Hosteins Operations Research: Closing the Gap Between Research and Practice, 195-204, 2026 | | 2026 |
| A Scatter Search Metaheuristic and Improvements to an Exact Algorithm for the Weighted Safe Set Problem A Boggio Tomasaz, R Cordone International Conference on Operations Research and Enterprise Systems, 90-112, 2024 | | 2024 |
| GRASP approaches to the Weighted Safe Set Problem A BOGGIO TOMASAZ, R Cordone, P Hosteins | | 2022 |
Roberto CordoneUniversità degli Studi di MilanoVerified email at unimi.it
