Pubblicazioni

A Semidefinite Programming-Based Branch-and-Cut Algorithm for Biclustering

2024 - INFORMS JOURNAL ON COMPUTING
Sudoso, Antonio M.

A Numerically Exact Algorithm for the Bin-Packing Problem

2023 - INFORMS JOURNAL ON COMPUTING
Baldacci, Roberto; Coniglio, Stefano; Cordeau, Jean-François; Furini, Fabio

{SOS}-{SDP}: An Exact Solver for Minimum Sum-of-Squares Clustering

2022 - INFORMS JOURNAL ON COMPUTING
Piccialli, Veronica; Sudoso, Antonio M.; Wiegele, Angelika

A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems

2022 - INFORMS JOURNAL ON COMPUTING
De Santis, M; de Vries, S; Schmidt, M; Winkel, L

A branch-and-price framework for decomposing graphs into relaxed cliques

2021 - INFORMS JOURNAL ON COMPUTING
Gschwind, T.; Irnich, S.; Furini, F.; Calvo, R. W.

Modeling two-dimensional guillotine cutting problems via integer programming

2016 - INFORMS JOURNAL ON COMPUTING
Furini, F.; Malaguti, E.; Thomopulos, D.

Heuristic and exact algorithms for the interval min-max regret knapsack problem

2015 - INFORMS JOURNAL ON COMPUTING
Furini, F.; Iori, M.; Martello, S.; Yagiura, M.

© Università degli Studi di Roma "La Sapienza" - Piazzale Aldo Moro 5, 00185 Roma