Benedetto Manca

According to our database, Benedetto Manca authored at least 6 papers between 2021 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2025

Difference of Convex programming in adversarial SVM.

Annabella Astorino, Manlio Gaudioso, Enrico Gorgone, Benedetto Manca

J. Comput. Appl. Math., 2025

2023

Random Projections for Linear Programming: An Improved Retrieval Phase.

Leo Liberti, Benedetto Manca, Pierre-Louis Poirion

ACM J. Exp. Algorithmics, December, 2023

Ellipsoidal classification via semidefinite programming.

Annabella Astorino, Antonio Frangioni, Enrico Gorgone, Benedetto Manca

Oper. Res. Lett., March, 2023

2022

Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections.

Leo Liberti, Benedetto Manca

J. Glob. Optim., 2022

Practical Performance of Random Projections in Linear Programming.

Leo Liberti, Benedetto Manca, Pierre-Louis Poirion

Proceedings of the 20th International Symposium on Experimental Algorithms, 2022

2021

Polyhedral separation via difference of convex (DC) programming.

Annabella Astorino, Massimo Di Francesco, Manlio Gaudioso, Enrico Gorgone, Benedetto Manca

Soft Comput., 2021