Manlio Gaudioso

According to our database1, Manlio Gaudioso authored at least 50 papers between 1982 and 2019.

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



In proceedings 
PhD thesis 





A Lagrangian Relaxation Approach for Binary Multiple Instance Classification.
IEEE Trans. Neural Netw. Learning Syst., 2019

Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization.
Optimization Methods and Software, 2019

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

Multiple Instance Learning Algorithm for Medical Image Classification.
Proceedings of the 27th Italian Symposium on Advanced Database Systems, 2019

Truck synchronization at single door cross-docking terminals.
OR Spectrum, 2018

A Lagrangean-based decomposition approach for the link constrained Steiner tree problem.
Optimization Methods and Software, 2018

A savings-based model for two-shipper cooperative routing.
Optimization Letters, 2018

Minimizing Piecewise-Concave Functions Over Polyhedra.
Math. Oper. Res., 2018

Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations.
J. Global Optimization, 2018

Numerical infinitesimals in a variable metric method for convex nonsmooth optimization.
Applied Mathematics and Computation, 2018

A Multiple Instance Learning Algorithm for Color Images Classification.
Proceedings of the 22nd International Database Engineering & Applications Symposium, 2018

A DC optimization-based clustering technique for edge detection.
Optimization Letters, 2017

Malicious URL detection via spherical classification.
Neural Computing and Applications, 2017

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

Lagrangian relaxation for SVM feature selection.
Computers & OR, 2017

A novel discretization scheme for the close enough traveling salesman problem.
Computers & OR, 2017

OMEGA one multi ethnic genetic approach.
Optimization Letters, 2016

On numerical solving the spherical separability problem.
J. Global Optimization, 2016

Central axes and peripheral points in high dimensional directional datasets.
Comp. Opt. and Appl., 2016

An Algorithm to Find the Link Constrained Steiner Tree in Undirected Graphs.
Proceedings of the Mathematical Software - ICMS 2016, 2016

Optimal Replenishment Order Placement in a Finite Time Horizon.
J. Optimization Theory and Applications, 2015

Vladimir Fedorovich Demyanov (18.08.1938-18.04.2014).
J. Global Optimization, 2014

An illumination problem: optimal apex and optimal orientation for a cone of light.
J. Global Optimization, 2014

Edge detection by spherical separation.
Comput. Manag. Science, 2014

Lower and upper bounds for the spanning tree with minimum branch vertices.
Comp. Opt. and Appl., 2013

Margin maximization in spherical separation.
Comp. Opt. and Appl., 2012

Piecewise-quadratic Approximations in Convex Numerical Optimization.
SIAM Journal on Optimization, 2011

Gradient set splitting in nonconvex nonsmooth numerical optimization.
Optimization Methods and Software, 2010

Optimization Methods and Software, 2010

DC models for spherical separation.
J. Global Optimization, 2010

Least Square Regression Method for Estimating Gas Concentration in an Electronic Nose System.
Sensors, 2009

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

On solving the Lagrangian dual of integer programs via an incremental approach.
Comp. Opt. and Appl., 2009

A fixed-center spherical separation algorithm with kernel transformations for classification problems.
Comput. Manag. Science, 2009

The service allocation problem at the Gioia Tauro Maritime Terminal.
European Journal of Operational Research, 2007

On the Use of the SVM Approach in Analyzing an Electronic Nose.
Proceedings of the 7th International Conference on Hybrid Intelligent Systems (HIS 2007), 2007

An Incremental Method for Solving Convex Finite Min-Max Problems.
Math. Oper. Res., 2006

A Memetic Heuristic for the Generalized Quadratic Assignment Problem.
INFORMS Journal on Computing, 2006

Optimization Methods and Software, 2005

Ellipsoidal separation for classification problems.
Optimization Methods and Software, 2005

Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control.
SIAM Journal on Optimization, 2004

A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization.
Optimization Methods and Software, 2004

Nonsmooth optimization methods for parallel decomposition of multicommodity flow problems.
Annals OR, 1993

A Heuristic for the Periodic Vehicle Routing Problem.
Transportation Science, 1992

A class of manpower scheduling problems.
ZOR - Meth. & Mod. of OR, 1992

Linear programming models for load balancing.
Computers & OR, 1991

Mean-variance approach to the management of cyclic deliveries.
Computers & OR, 1988

Stopping criteria for linesearch methods without derivatives.
Math. Program., 1984

Probabilistic Appraoch to Evaluation of Data Manipulation Algorithms in a CODASYL Data Base Environment.
Proceedings of the Second International Conference On Databases, 1983

A bundle type approach to the unconstrained minimization of convex nonsmooth functions.
Math. Program., 1982