Manlio Gaudioso

Giampaolo Liuzzi

Stefano Lucidi

Optim. Lett., January, 2024

2023

New mixed integer fractional programming problem and some multi-objective models for sparse optimization.

[BibT_eX]

[DOI]

Behzad Pirouz

Soft Comput., November, 2023

Sparse optimization via vector k-norm and DC programming with an application to feature selection for support vector machines.

[BibT_eX]

[DOI]

Comput. Optim. Appl., November, 2023

Bundle Enrichment Method for Nonsmooth Difference of Convex Programming Problems.

[BibT_eX]

[DOI]

Algorithms, 2023

2022

A heuristic approach for multiple instance learning by linear separation.

[BibT_eX]

[DOI]

Soft Comput., 2022

Deforming $||.||_{1}$ into $||.||_{\infty}$ via Polyhedral Norms: A Pedestrian Approach.

[BibT_eX]

[DOI]

Jean-Baptiste Hiriart-Urruty

SIAM Rev., 2022

Essentials of numerical nonsmooth optimization.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2022

2021

Polyhedral separation via difference of convex (DC) programming.

[BibT_eX]

[DOI]

Soft Comput., 2021

A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs.

[BibT_eX]

[DOI]

Francesco Carrabs

Networks, 2021

A Lagrangean relaxation approach to lifetime maximization of directional sensor networks.

[BibT_eX]

[DOI]

Networks, 2021

A new extended formulation with valid inequalities for the Capacitated Concentrator Location Problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2021

2020

Classification in the multiple instance learning framework via spherical separation.

[BibT_eX]

[DOI]

Eugenio Vocaturo

Soft Comput., 2020

Feature selection in SVM via polyhedral k-norm.

[BibT_eX]

[DOI]

Jean-Baptiste Hiriart-Urruty

Optim. Lett., 2020

2019

A Lagrangian Relaxation Approach for Binary Multiple Instance Classification.

[BibT_eX]

[DOI]

IEEE Trans. Neural Networks Learn. Syst., 2019

Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization.

[BibT_eX]

[DOI]

Napsu Karmitsa

Kaisa Joki

Optim. Methods Softw., 2019

The forwarder planning problem in a two-echelon network.

[BibT_eX]

[DOI]

Networks, 2019

Multiple Instance Learning Algorithm for Medical Image Classification.

[BibT_eX]

[DOI]

Proceedings of the 27th Italian Symposium on Advanced Database Systems, 2019

2018

Truck synchronization at single door cross-docking terminals.

[BibT_eX]

[DOI]

Antonino Chiarello

Marcello Sammarra

OR Spectr., 2018

A Lagrangean-based decomposition approach for the link constrained Steiner tree problem.

[BibT_eX]

[DOI]

Luigi Di Puglia Pugliese

Francesca Guerriero

Optim. Methods Softw., 2018

A savings-based model for two-shipper cooperative routing.

[BibT_eX]

[DOI]

Optim. Lett., 2018

Minimizing Piecewise-Concave Functions Over Polyhedra.

[BibT_eX]

[DOI]

Math. Oper. Res., 2018

Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations.

[BibT_eX]

[DOI]

Adil M. Bagirov

J. Glob. Optim., 2018

Numerical infinitesimals in a variable metric method for convex nonsmooth optimization.

[BibT_eX]

[DOI]

Marat S. Mukhametzhanov

Appl. Math. Comput., 2018

A Multiple Instance Learning Algorithm for Color Images Classification.

[BibT_eX]

[DOI]

Proceedings of the 22nd International Database Engineering & Applications Symposium, 2018

2017

A DC optimization-based clustering technique for edge detection.

[BibT_eX]

[DOI]

Optim. Lett., 2017

Malicious URL detection via spherical classification.

[BibT_eX]

[DOI]

Neural Comput. Appl., 2017

A method for convex minimization based on translated first-order approximations.

[BibT_eX]

[DOI]

Numer. Algorithms, 2017

Lagrangian relaxation for SVM feature selection.

[BibT_eX]

[DOI]

Antonio M. Rodríguez-Chía

Martine Labbé

Comput. Oper. Res., 2017

A novel discretization scheme for the close enough traveling salesman problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2017

2016

OMEGA one multi ethnic genetic approach.

[BibT_eX]

[DOI]

Carmine Cerrone

Raffaele Cerulli

Optim. Lett., 2016

On numerical solving the spherical separability problem.

[BibT_eX]

[DOI]

Alexander S. Strekalovsky

Tatyana V. Gruzdeva

J. Glob. Optim., 2016

Central axes and peripheral points in high dimensional directional datasets.

[BibT_eX]

[DOI]

Alberto Seeger

Comput. Optim. Appl., 2016

An Algorithm to Find the Link Constrained Steiner Tree in Undirected Graphs.

[BibT_eX]

[DOI]

Luigi Di Puglia Pugliese

Francesca Guerriero

Proceedings of the Mathematical Software - ICMS 2016, 2016

2015

Optimal Replenishment Order Placement in a Finite Time Horizon.

[BibT_eX]

[DOI]

J. Optim. Theory Appl., 2015

A partially inexact bundle method for convex semi-infinite minmax problems.

[BibT_eX]

[DOI]

Commun. Nonlinear Sci. Numer. Simul., 2015

2014

Vladimir Fedorovich Demyanov (18.08.1938-18.04.2014).

[BibT_eX]

[DOI]

Vasily N. Malozemov

Yaroslav D. Sergeyev

J. Glob. Optim., 2014

An illumination problem: optimal apex and optimal orientation for a cone of light.

[BibT_eX]

[DOI]

Alberto Seeger

J. Glob. Optim., 2014

Edge detection by spherical separation.

[BibT_eX]

[DOI]

Walaa Khalaf

Comput. Manag. Sci., 2014

2013

Lower and upper bounds for the spanning tree with minimum branch vertices.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2013

2012

Margin maximization in spherical separation.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2012

2011

Piecewise-quadratic Approximations in Convex Numerical Optimization.

[BibT_eX]

[DOI]

SIAM J. Optim., 2011

2010

Gradient set splitting in nonconvex nonsmooth numerical optimization.

[BibT_eX]

[DOI]

Optim. Methods Softw., 2010

Foreword.

[BibT_eX]

[DOI]

Optim. Methods Softw., 2010

DC models for spherical separation.

[BibT_eX]

[DOI]

J. Glob. Optim., 2010

2009

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

[BibT_eX]

[DOI]

Walaa Khalaf

Calogero Pace

Sensors, 2009

Piecewise linear approximations in nonconvex nonsmooth optimization.

[BibT_eX]

[DOI]

Maria Flavia Monaco

Numerische Mathematik, 2009

On solving the Lagrangian dual of integer programs via an incremental approach.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2009

A fixed-center spherical separation algorithm with kernel transformations for classification problems.

[BibT_eX]

[DOI]

Comput. Manag. Sci., 2009

2007

The service allocation problem at the Gioia Tauro Maritime Terminal.

[BibT_eX]

[DOI]

Jean-François Cordeau

Gilbert Laporte

Luigi Moccia

Eur. J. Oper. Res., 2007

On the Use of the SVM Approach in Analyzing an Electronic Nose.

[BibT_eX]

[DOI]

Walaa Khalaf

Calogero Pace

Proceedings of the 7th International Conference on Hybrid Intelligent Systems, 2007

2006

An Incremental Method for Solving Convex Finite Min-Max Problems.

[BibT_eX]

[DOI]

Math. Oper. Res., 2006

A Memetic Heuristic for the Generalized Quadratic Assignment Problem.

[BibT_eX]

[DOI]

Jean-François Cordeau

Gilbert Laporte

Luigi Moccia

INFORMS J. Comput., 2006

2005

Preface.

[BibT_eX]

[DOI]

Vladimir F. Demyanov

Optim. Methods Softw., 2005

Ellipsoidal separation for classification problems.

[BibT_eX]

[DOI]

Optim. Methods Softw., 2005

2004

Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control.

[BibT_eX]

[DOI]

SIAM J. Optim., 2004

A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization.

[BibT_eX]

[DOI]

Optim. Methods Softw., 2004

1993

Nonsmooth optimization methods for parallel decomposition of multicommodity flow problems.

[BibT_eX]

[DOI]

Renato De Leone

Maria Flavia Monaco

Ann. Oper. Res., 1993

1992

A Heuristic for the Periodic Vehicle Routing Problem.

[BibT_eX]

[DOI]

Giuseppe Paletta

Transp. Sci., 1992

A class of manpower scheduling problems.

[BibT_eX]

[DOI]

Raffaele Cerulli

R. Mautone

ZOR Methods Model. Oper. Res., 1992

1991

Linear programming models for load balancing.

[BibT_eX]

[DOI]

Pasquale Legato

Comput. Oper. Res., 1991

1988

Mean-variance approach to the management of cyclic deliveries.

[BibT_eX]

[DOI]

Raffaele Cerulli

Comput. Oper. Res., 1988

1984

Stopping criteria for linesearch methods without derivatives.

[BibT_eX]

[DOI]

Renato De Leone

Luigi Grippo

Math. Program., 1984

1983

Probabilistic Appraoch to Evaluation of Data Manipulation Algorithms in a CODASYL Data Base Environment.

[BibT_eX]

Proceedings of the Second International Conference On Databases, 1983

1982

A bundle type approach to the unconstrained minimization of convex nonsmooth functions.

[BibT_eX]

[DOI]