Enrico Gorgone

Orcid: 0000-0001-5330-9931

According to our database1, Enrico Gorgone authored at least 23 papers between 2008 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Ellipsoidal classification via semidefinite programming.
Oper. Res. Lett., March, 2023

2022
Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design.
Discret. Appl. Math., 2022

High quality timetables for Italian schools.
Comput. Oper. Res., 2022

2021
Polyhedral separation via difference of convex (DC) programming.
Soft Comput., 2021

Preface: Special issue on freight transportation and logistics.
Networks, 2021

A new extended formulation with valid inequalities for the Capacitated Concentrator Location Problem.
Eur. J. Oper. Res., 2021

2020
Feature selection in SVM via polyhedral k-norm.
Optim. Lett., 2020

Quasi-Separable Dantzig-Wolfe Reformulations for Network Design.
Proceedings of the Combinatorial Optimization - 6th International Symposium, 2020

2019
The forwarder planning problem in a two-echelon network.
Networks, 2019

2018
Dynamic smoothness parameter for fast gradient methods.
Optim. Lett., 2018

2017
A Lagrangian heuristic algorithm for the time-dependent combined network design and routing problem.
Networks, 2017

A method for convex minimization based on translated first-order approximations.
Numer. Algorithms, 2017

On the computational efficiency of subgradient methods: a case study with Lagrangian bounds.
Math. Program. Comput., 2017

Lagrangian relaxation for SVM feature selection.
Comput. Oper. Res., 2017

2015
Lagrangian relaxation for the time-dependent combined network design and routing problem.
Proceedings of the 2015 IEEE International Conference on Communications, 2015

2014
Bundle methods for sum-functions with "easy" components: applications to multicommodity network design.
Math. Program., 2014

2013
A Nonmonotone Proximal Bundle Method with (Potentially) Continuous Step Decisions.
SIAM J. Optim., 2013

A library for continuous convex separable quadratic knapsack problems.
Eur. J. Oper. Res., 2013

2011
Piecewise-quadratic Approximations in Convex Numerical Optimization.
SIAM J. Optim., 2011

2010
Gradient set splitting in nonconvex nonsmooth numerical optimization.
Optim. Methods Softw., 2010

Nonsmooth optimization: theory and algorithms.
4OR, 2010

2009
Piecewise linear approximations in nonconvex nonsmooth optimization.
Numerische Mathematik, 2009

2008
Non-smoothness in classification problems.
Optim. Methods Softw., 2008


  Loading...