Non-smoothness in classification problems. - Annabella Astorino; Antonio Fuduli; Enrico Gorgone (Optim. Methods Softw., 2008)

Piecewise linear approximations in nonconvex nonsmooth optimization. - Manlio Gaudioso; Enrico Gorgone; Maria Flavia Monaco (Numerische Mathematik, 2009)

Nonsmooth optimization: theory and algorithms. - Enrico Gorgone (4OR, 2010)

Gradient set splitting in nonconvex nonsmooth numerical optimization. - Manlio Gaudioso; Enrico Gorgone (Optim. Methods Softw., 2010)

Piecewise-quadratic Approximations in Convex Numerical Optimization. - Annabella Astorino; Antonio Frangioni; Manlio Gaudioso; Enrico Gorgone (SIAM J. Optim., 2011)

A library for continuous convex separable quadratic knapsack problems. - Antonio Frangioni; Enrico Gorgone (Eur. J. Oper. Res., 2013)

A Nonmonotone Proximal Bundle Method with (Potentially) Continuous Step Decisions. - Annabella Astorino; Antonio Frangioni; Antonio Fuduli; Enrico Gorgone (SIAM J. Optim., 2013)

Bundle methods for sum-functions with "easy" components: applications to multicommodity network design. - Antonio Frangioni; Enrico Gorgone (Math. Program., 2014)

Lagrangian relaxation for the time-dependent combined network design and routing problem. - Dimitri Papadimitriou; Bernard Fortz; Enrico Gorgone (ICC, 2015)

Lagrangian relaxation for SVM feature selection. - Manlio Gaudioso; Enrico Gorgone; Martine Labbé; Antonio M. Rodríguez-Chía (Comput. Oper. Res., 2017)

On the computational efficiency of subgradient methods: a case study with Lagrangian bounds. - Antonio Frangioni; Bernard Gendron; Enrico Gorgone (Math. Program. Comput., 2017)

A method for convex minimization based on translated first-order approximations. - Annabella Astorino; Manlio Gaudioso; Enrico Gorgone (Numer. Algorithms, 2017)

A Lagrangian heuristic algorithm for the time-dependent combined network design and routing problem. - Bernard Fortz; Enrico Gorgone; Dimitri Papadimitriou (Networks, 2017)

Dynamic smoothness parameter for fast gradient methods. - Antonio Frangioni; Bernard Gendron; Enrico Gorgone (Optim. Lett., 2018)

The forwarder planning problem in a two-echelon network. - Massimo Di Francesco; Manlio Gaudioso; Enrico Gorgone; Paola Zuddas (Networks, 2019)

Quasi-Separable Dantzig-Wolfe Reformulations for Network Design. - Antonio Frangioni; Bernard Gendron; Enrico Gorgone (ISCO, 2020)

Feature selection in SVM via polyhedral k-norm. - Manlio Gaudioso; Enrico Gorgone; Jean-Baptiste Hiriart-Urruty (Optim. Lett., 2020)

A new extended formulation with valid inequalities for the Capacitated Concentrator Location Problem. - Massimo Di Francesco; Manlio Gaudioso; Enrico Gorgone; Ishwar Murthy (Eur. J. Oper. Res., 2021)

Preface: Special issue on freight transportation and logistics. - Massimo Di Francesco; Enrico Gorgone; Roberto Wolfler Calvo; Paola Zuddas (Networks, 2021)

Polyhedral separation via difference of convex (DC) programming. - Annabella Astorino; Massimo Di Francesco; Manlio Gaudioso; Enrico Gorgone; Benedetto Manca (Soft Comput., 2021)

High quality timetables for Italian schools. - Claudio Crobu; Massimo Di Francesco; Enrico Gorgone (Comput. Oper. Res., 2022)

Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design. - Mohammad Rahim Akhavan Kazemzadeh; Tolga Bektas; Teodor Gabriel Crainic; Antonio Frangioni; Bernard Gendron; Enrico Gorgone (Discret. Appl. Math., 2022)

DC Optimization in Adversarial Sparse Support Vector Machine. - Annabella Astorino; Massimo Di Francesco; Manlio Gaudioso; Enrico Gorgone; Benedetto Manca (NUMTA (1), 2023)

Ellipsoidal classification via semidefinite programming. - Annabella Astorino; Antonio Frangioni; Enrico Gorgone; Benedetto Manca (Oper. Res. Lett., 2023)

Multi-day routes in a multi-depot vehicle routing problem with intermediate replenishment facilities and time windows. - Matteo Avolio; Massimo Di Francesco; Antonio Fuduli; Enrico Gorgone; Roberto Wolfler Calvo (Comput. Oper. Res., 2025)

Difference of Convex programming in adversarial SVM. - Annabella Astorino; Manlio Gaudioso; Enrico Gorgone; Benedetto Manca (J. Comput. Appl. Math., 2025)