Veronica Piccialli

Dolores Romero Morales

Cecilia Salvatore

Eur. J. Oper. Res., 2024

2023

Data augmentation driven by optimization for membrane separation process synthesis.

[BibT_eX]

[DOI]

Comput. Chem. Eng., September, 2023

Optimization meets Machine Learning: An Exact Algorithm for Semi-Supervised Support Vector Machines.

[BibT_eX]

[DOI]

Jan Schwiddessen

CoRR, 2023

Predicting municipalities in financial distress: a machine learning approach enhanced by domain expertise.

[BibT_eX]

[DOI]

Dario Piermarini

CoRR, 2023

2022

Mixed-Integer Nonlinear Programming for State-Based Non-Intrusive Load Monitoring.

[BibT_eX]

[DOI]

Marco Balletti

IEEE Trans. Smart Grid, 2022

A computational study on QP problems with general linear constraints.

[BibT_eX]

[DOI]

Marco Locatelli

Optim. Lett., 2022

SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering.

[BibT_eX]

[DOI]

Angelika Wiegele

INFORMS J. Comput., 2022

Global Optimization for Cardinality-constrained Minimum Sum-of-Squares Clustering via Semidefinite Programming.

[BibT_eX]

[DOI]

CoRR, 2022

An exact algorithm for semi-supervised minimum sum-of-squares clustering.

[BibT_eX]

[DOI]

Anna Russo Russo

Comput. Oper. Res., 2022

Improving P300 Speller performance by means of optimization and machine learning.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2022

2021

A machine learning approach for forecasting hierarchical time series.

[BibT_eX]

[DOI]

Paolo Mancuso

Expert Syst. Appl., 2021

Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2021

2020

Oil Spill Detection from SAR Images by Deep Learning.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Geoscience and Remote Sensing Symposium, 2020

2019

Single courier single restaurant meal delivery (without routing).

[BibT_eX]

[DOI]

Oper. Res. Lett., 2019

A new branch-and-bound algorithm for standard quadratic programming problems.

[BibT_eX]

[DOI]

Marco Locatelli

Optim. Methods Softw., 2019

Three methods for robust grading.

[BibT_eX]

[DOI]

Samuel Burer

Eur. J. Oper. Res., 2019

Non-Intrusive Load Monitoring with an Attention-based Deep Neural Network.

[BibT_eX]

[DOI]

CoRR, 2019

Group study via collaborative BCI.

[BibT_eX]

[DOI]

Luigi Bianchi

Francesco Gambardella

Chiara Liti

Proceedings of the 2019 IEEE International Conference on Systems, Man and Cybernetics, 2019

A Score based method for P300 Collaborative BCI.

[BibT_eX]

[DOI]

Chiara Liti

Luigi Bianchi

Francesco Gambardella

Proceedings of the 8th Graz Brain-Computer Interface Conference 2019, 2019

2018

Scheduling the Italian National Volleyball Tournament.

[BibT_eX]

[DOI]

Guido Cocchi

Alessandro Galligari

Federica Picca Nicolino

Fabio Schoen

Interfaces, 2018

A multi-objective DIRECT algorithm for ship hull optimization.

[BibT_eX]

[DOI]

Emilio Fortunato Campana

Comput. Optim. Appl., 2018

Nonlinear optimization and support vector machines.

[BibT_eX]

[DOI]

4OR, 2018

2017

An Optimization-Based Method for Feature Ranking in Nonlinear Regression Problems.

[BibT_eX]

[DOI]

Luca Bravi

Vittoria De Nitto Persone

IEEE Trans. Neural Networks Learn. Syst., 2017

Optimal design of a regional railway service in Italy.

[BibT_eX]

[DOI]

J. Rail Transp. Plan. Manag., 2017

Can Feature Selection be used to Detect Physiological Components in P300 based BCI for amyotrophic lateral Sclerosis patients?

[BibT_eX]

[DOI]

Proceedings of the From Vision to Reality, 2017

2016

A Game-Theoretic Approach for Regulating Hazmat Transportation.

[BibT_eX]

[DOI]

Transp. Sci., 2016

A game-theoretic approach to computation offloading in mobile cloud computing.

[BibT_eX]

[DOI]

Valeria Cardellini

Math. Program., 2016

A DIRECT-type approach for derivative-free constrained global optimization.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2016

Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2016

2012

SpeeDP: an algorithm to compute SDP bounds for very large Max-Cut instances.

[BibT_eX]

[DOI]

Math. Program., 2012

2011

An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem.

[BibT_eX]

[DOI]

Luigi Grippo

Laura Palagi

Math. Program., 2011

A Modified DIviding RECTangles Algorithm for a Problem in Astrophysics.

[BibT_eX]

[DOI]

J. Optim. Theory Appl., 2011

Decomposition algorithms for generalized potential games.

[BibT_eX]

[DOI]

Francisco Facchinei

Comput. Optim. Appl., 2011

2010

A partition-based global optimization algorithm.

[BibT_eX]

[DOI]

J. Glob. Optim., 2010

A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2010

2009

Generalized Nash equilibrium problems and Newton methods.

[BibT_eX]

[DOI]

Francisco Facchinei

Andreas Fischer

Math. Program., 2009

Necessary and sufficient global optimality conditions for NLP reformulations of linear SDP problems.

[BibT_eX]

[DOI]

Luigi Grippo

Laura Palagi

J. Glob. Optim., 2009

2007

On generalized Nash games and variational inequalities.

[BibT_eX]

[DOI]

Francisco Facchinei

Andreas Fischer

Oper. Res. Lett., 2007

2005

An Algorithm Model for Mixed Variable Programming.

[BibT_eX]

[DOI]

SIAM J. Optim., 2005

Design of induction motors using a mixed-variable approach.

[BibT_eX]

[DOI]

Comput. Manag. Sci., 2005

2004

A derivative-based algorithm for a particular class of mixed variable optimization problems.

[BibT_eX]

[DOI]

Optim. Methods Softw., 2004

A magnetic resonance device designed via global optimization techniques.

[BibT_eX]

[DOI]

Math. Program., 2004

2002

New Classes of Globally Convexized Filled Functions for Global Optimization.

[BibT_eX]

[DOI]