Pubblicazioni

Using dual relaxations in multiobjective mixed-integer convex quadratic programming

2024 - JOURNAL OF GLOBAL OPTIMIZATION
De Santis, Marianna; Eichfelder, Gabriele; Patria, Daniele; Warnow, Leo

A decision space algorithm for multiobjective convex quadratic integer optimization

2021 - COMPUTERS & OPERATIONS RESEARCH
De Santis, M.; Eichfelder, G.

A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts

2021 - EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Coniglio, S.; Furini, F.; San Segundo, P.

A new branch-and-bound algorithm for the Maximum Weighted Clique Problem

2019 - COMPUTERS & OPERATIONS RESEARCH
San Segundo, P.; Furini, F.; Artieda, J.

An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem

2017 - NETWORKS
Furini, F.; Gabrel, V.; Ternier, I. -C.

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