Marco Locatelli

Proceedings of the 62nd IEEE Conference on Decision and Control, 2023

2022

A Sequential Algorithm for Jerk Limited Speed Planning.

[BibT_eX]

[DOI]

Andrea Minari

IEEE Trans Autom. Sci. Eng., 2022

A computational study on QP problems with general linear constraints.

[BibT_eX]

[DOI]

Giampaolo Liuzzi

Veronica Piccialli

Optim. Lett., 2022

Exact and approximate results for convex envelopes of special structured functions over simplices.

[BibT_eX]

[DOI]

J. Glob. Optim., 2022

Constrained Multi-Agent Path Finding on Directed Graphs.

[BibT_eX]

[DOI]

CoRR, 2022

Multi-Agent Path Finding on Strongly Connected Digraphs: feasibility and solution algorithms.

[BibT_eX]

[DOI]

CoRR, 2022

Shortest path with acceleration constraints: complexity and approximation algorithms.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2022

Tool Switching Problems in the Context of Overlay Printing with Multiple Colours.

[BibT_eX]

[DOI]

Alberto Locatelli

Juan José Salazar González

Proceedings of the Combinatorial Optimization - 7th International Symposium, 2022

Multi-Agent Path Finding on Strongly Connected Digraphs.

[BibT_eX]

[DOI]

Proceedings of the 61st IEEE Conference on Decision and Control, 2022

2021

A Graph-Based Algorithm for Optimal Control of Switched Systems: An Application to Car Parking.

[BibT_eX]

[DOI]

IEEE Trans. Autom. Control., 2021

Optimizing Cooperative Pallet Loading Robots: A Mixed Integer Approach.

[BibT_eX]

[DOI]

IEEE Robotics Autom. Lett., 2021

(Global) Optimization: Historical notes and recent developments.

[BibT_eX]

[DOI]

EURO J. Comput. Optim., 2021

The Bounded Acceleration Shortest Path problem: complexity and solution algorithms.

[BibT_eX]

[DOI]

CoRR, 2021

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

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2021

Scheduling of Parallel Print Machines with Sequence-Dependent Setup Costs: A Real-World Case Study.

[BibT_eX]

[DOI]

Alberto Locatelli

Proceedings of the Advances in Production Management Systems. Artificial Intelligence for Sustainable and Resilient Production Systems, 2021

Efficient solution algorithms for the Bounded Acceleration Shortest Path problem.

[BibT_eX]

[DOI]

Proceedings of the 2021 60th IEEE Conference on Decision and Control (CDC), 2021

2020

Convergence Analysis of Spatial-Sampling-Based Algorithms for Time-Optimal Smooth Velocity Planning.

[BibT_eX]

[DOI]

J. Optim. Theory Appl., 2020

Convex envelope of bivariate cubic functions over rectangular regions.

[BibT_eX]

[DOI]

J. Glob. Optim., 2020

A solution of the minimum-time speed planning problem based on lattice theory.

[BibT_eX]

[DOI]

J. Frankl. Inst., 2020

Efficient local search procedures for quadratic fractional programming problems.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2020

A Mixed Approach for Pallet Building Problem with Practical Constraints.

[BibT_eX]

[DOI]

Mayron César O. Moreira

Tiago Silveira

Proceedings of the Enterprise Information Systems - 22nd International Conference, 2020

Solution of a Practical Pallet Building Problem with Visibility and Contiguity Constraints.

[BibT_eX]

[DOI]

Mayron César O. Moreira

Tiago Silveira

Proceedings of the 22nd International Conference on Enterprise Information Systems, 2020

Reactive GRASP-Based Algorithm for Pallet Building Problem with Visibility and Contiguity Constraints.

[BibT_eX]

[DOI]

Mayron César O. Moreira

Tiago Silveira

Proceedings of the Computational Logistics - 11th International Conference, 2020

Fast numerical solution of optimal control problems for switched systems: An application to path planning.

[BibT_eX]

[DOI]

Proceedings of the 59th IEEE Conference on Decision and Control, 2020

2019

Optimal Time-Complexity Speed Planning for Robot Manipulators.

[BibT_eX]

[DOI]

IEEE Trans. Robotics, 2019

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

[BibT_eX]

[DOI]

Giampaolo Liuzzi

Veronica Piccialli

Optim. Methods Softw., 2019

Globally Optimal Registration based on Fast Branch and Bound.

[BibT_eX]

[DOI]

CoRR, 2019

Graph-based algorithms for the efficient solution of optimization problems involving monotone functions.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2019

2018

Convex envelopes of separable functions over regions defined by separable functions of the same type.

[BibT_eX]

[DOI]

Optim. Lett., 2018

Convex envelopes of bivariate functions through the solution of KKT systems.

[BibT_eX]

[DOI]

J. Glob. Optim., 2018

Time-optimal velocity planning by a bound-tightening technique.

[BibT_eX]

[DOI]

Federico Cabassi

Comput. Optim. Appl., 2018

A Multigraph-Based Selective Update Method for the Efficient Solution of Dynamic Programming.

[BibT_eX]

[DOI]

Proceedings of the 57th IEEE Conference on Decision and Control, 2018

2017

On the Complexity of Optimal Power Allocation in a Multi-Tone Multiuser Communication System.

[BibT_eX]

[DOI]

Zhi-Quan Luo

IEEE Trans. Inf. Theory, 2017

Corrigendum to "An optimal complexity algorithm for minimum-time velocity planning" [Systems & Control Letters 103 (2017) 50-57].

[BibT_eX]

[DOI]

Syst. Control. Lett., 2017

An optimal complexity algorithm for minimum-time velocity planning.

[BibT_eX]

[DOI]

Syst. Control. Lett., 2017

On the complexity of quadratic programming with two quadratic constraints.

[BibT_eX]

[DOI]

Math. Program., 2017

Path planning with limited numbers of maneuvers for automatic guided vehicles: An optimization-based approach.

[BibT_eX]

[DOI]

Piero Micelli

Proceedings of the 25th Mediterranean Conference on Control and Automation, 2017

A branch and bound approach for a class of non-convex problems with applications to robust regression.

[BibT_eX]

[DOI]

Francesco Denaro

Proceedings of the 25th Mediterranean Conference on Control and Automation, 2017

2016

Exactness conditions for an SDP relaxation of the extended trust region problem.

[BibT_eX]

[DOI]

Optim. Lett., 2016

Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes.

[BibT_eX]

[DOI]

J. Glob. Optim., 2016

Non polyhedral convex envelopes for 1-convex functions.

[BibT_eX]

[DOI]

J. Glob. Optim., 2016

Computational investigation of simple memetic approaches for continuous global optimization.

[BibT_eX]

[DOI]

Federico Cabassi

Comput. Oper. Res., 2016

Theoretical and computational results about optimality-based domain reductions.

[BibT_eX]

[DOI]

Alberto Caprara

Corrado Guarino Lo Bianco

Michele Monaci

Comput. Optim. Appl., 2016

A real-time strategy for the management of kinematic singularities: New progresses.

[BibT_eX]

[DOI]

Marina Raineri

Simone Perri

Proceedings of the 21st International Conference on Methods and Models in Automation and Robotics, 2016

A linear-time algorithm for minimum-time velocity planning of autonomous vehicles.

[BibT_eX]

[DOI]

Proceedings of the 24th Mediterranean Conference on Control and Automation, 2016

A Jacobi-like acceleration for dynamic programming.

[BibT_eX]

[DOI]

Proceedings of the 55th IEEE Conference on Decision and Control, 2016

2015

Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex.

[BibT_eX]

[DOI]

SIAM J. Optim., 2015

Some results for quadratic problems with one or two quadratic constraints.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2015

Alternative branching rules for some nonconvex problems.

[BibT_eX]

[DOI]

Optim. Methods Softw., 2015

(Non) convergence results for the differential evolution method.

[BibT_eX]

[DOI]

Optim. Lett., 2015

Improving upper bounds for the clique number by non-valid inequalities.

[BibT_eX]

[DOI]

Math. Program., 2015

A Computational Comparison of Memetic Differential Evolution Approaches.

[BibT_eX]

[DOI]

Federico Cabassi

Corrado Guarino Lo Bianco

Proceedings of the Genetic and Evolutionary Computation Conference, 2015

Jerk bounded velocity planner for the online management of autonomous vehicles.

[BibT_eX]

[DOI]

Simone Perri

Proceedings of the IEEE International Conference on Automation Science and Engineering, 2015

2014

On convex envelopes for bivariate functions over polytopes.

[BibT_eX]

[DOI]

Math. Program., 2014

A technique to derive the analytical form of convex envelopes for some bivariate functions.

[BibT_eX]

[DOI]

J. Glob. Optim., 2014

Differential evolution methods based on local searches.

[BibT_eX]

[DOI]

Mirko Maischberger

Comput. Oper. Res., 2014

2013

Computing the value of the convex envelope of quadratic forms over polytopes through a semidefinite program.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2013

Approximation algorithm for a class of global optimization problems.

[BibT_eX]

[DOI]

J. Glob. Optim., 2013

Optimization and homotopy methods for the Gibbs free energy of simple magmatic mixtures.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2013

Global optimization based on local searches.

[BibT_eX]

[DOI]

4OR, 2013

Global Optimization for Atomic Cluster Distance Geometry Problems.

[BibT_eX]

[DOI]

Proceedings of the Distance Geometry: Theory, Methods, and Applications, 2013

Global Optimization - Theory, Algorithms, and Applications.

[BibT_eX]

MOS-SIAM Series on Optimization 15, SIAM, ISBN: 978-1-61197-266-5, 2013

2012

Separable standard quadratic optimization problems.

[BibT_eX]

[DOI]

Optim. Lett., 2012

On the relation between concavity cuts and the surrogate dual for convex maximization problems.

[BibT_eX]

[DOI]

J. Glob. Optim., 2012

Local search based heuristics for global optimization: Atomic clusters and beyond.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2012

Branch and cut algorithms for detecting critical nodes in undirected graphs.

[BibT_eX]

[DOI]

Marco Di Summa

Comput. Optim. Appl., 2012

Machine learning for global optimization.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2012

2011

An Inflationary Differential Evolution Algorithm for Space Trajectory Optimization.

[BibT_eX]

[DOI]

Edmondo A. Minisci

IEEE Trans. Evol. Comput., 2011

Approximation of linear fractional-multiplicative problems.

[BibT_eX]

[DOI]

Daniele Depetrini

Math. Program., 2011

Complexity of the critical node problem over trees.

[BibT_eX]

[DOI]

Marco Di Summa

Comput. Oper. Res., 2011

A heuristic approach for packing identical rectangles in convex regions.

[BibT_eX]

[DOI]

Andrea Cassioli

Comput. Oper. Res., 2011

A global optimization method for the design of space trajectories.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2011

2010

Global optimization problems and domain reduction strategies.

[BibT_eX]

[DOI]

Alberto Caprara

Math. Program., 2010

Copositivity cuts for improving SDP bounds on the clique number.

[BibT_eX]

[DOI]

Florian Frommlet

Math. Program., 2010

Solving the problem of packing equal and unequal circles in a circular container.

[BibT_eX]

[DOI]

A. R. M. J. U. Jamali

J. Glob. Optim., 2010

Dissimilarity measures for population-based global optimization algorithms.

[BibT_eX]

[DOI]

Andrea Cassioli

Comput. Optim. Appl., 2010

2009

Global optimization of binary Lennard-Jones clusters.

[BibT_eX]

[DOI]

Andrea Cassioli

Optim. Methods Softw., 2009

A hybrid multiagent approach for global trajectory optimization.

[BibT_eX]

[DOI]

J. Glob. Optim., 2009

Finding maximin latin hypercube designs by Iterated Local Search heuristics.

[BibT_eX]

[DOI]

A. R. M. J. U. Jamali

Eur. J. Oper. Res., 2009

A heuristic approach for the max-min diversity problem based on max-clique.

[BibT_eX]

[DOI]

Federico Della Croce

Comput. Oper. Res., 2009

Solving molecular distance geometry problems by global optimization algorithms.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2009

A FPTAS for a class of linear multiplicative problems.

[BibT_eX]

[DOI]

Daniele Depetrini

Comput. Optim. Appl., 2009

RE-LIVING LAS VEGAS: A multi-user, mixed-reality edutainment environment based on the enhancement of original archival materials.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Virtual Environments, 2009

A dynamical system perspective on evolutionary heuristics applied to space trajectory optimization problems.

[BibT_eX]

[DOI]

Edmondo A. Minisci

Proceedings of the IEEE Congress on Evolutionary Computation, 2009

2008

Efficiently packing unequal disks in a circle.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2008

New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability.

[BibT_eX]

[DOI]

Fabio Tardella

Math. Program., 2008

Disk Packing in a Square: A New Global Optimization Approach.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2008

Simple ingredients leading to very efficient heuristics for the maximum clique problem.

[BibT_eX]

[DOI]

Wayne J. Pullan

J. Heuristics, 2008

2007

A Population-based Approach for Hard Global Optimization Problems based on Dissimilarity Measures.

[BibT_eX]

[DOI]

Math. Program., 2007

A new class of test functions for global optimization.

[BibT_eX]

[DOI]

J. Glob. Optim., 2007

An experimental analysis of a population based approach for global optimization.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2007

2006

A "maximum node clustering" problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 2006

2005

Local optima smoothing for global optimization.

[BibT_eX]

[DOI]

Optim. Methods Softw., 2005

Objective Function Features Providing Barriers to Rapid Global Optimization.

[BibT_eX]

[DOI]

Graham R. Wood

J. Glob. Optim., 2005

On the Multilevel Structure of Global Optimization Problems.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2005

Bidimensional Packing by Bilinear Programming.

[BibT_eX]

[DOI]

Alberto Caprara

Michele Monaci

Proceedings of the Integer Programming and Combinatorial Optimization, 2005

2004

The combinatorics of pivoting for the maximum weight clique.

[BibT_eX]

[DOI]

Marcello Pelillo

Oper. Res. Lett., 2004

Global Optimization of Morse Clusters by Potential Energy Transformations.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2004

Combining Swaps and Node Weights in an Adaptive Greedy Approach for the Maximum Clique Problem.

[BibT_eX]

[DOI]

Federico Della Croce

J. Heuristics, 2004

Undominated d.c. Decompositions of Quadratic Functions and Applications to Branch-and-Bound Approaches.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2004

2003

A Note on the Griewank Test Function.

[BibT_eX]

[DOI]

J. Glob. Optim., 2003

Efficient Algorithms for Large Scale Global Optimization: Lennard-Jones Clusters.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2003

Swap Strategies for Graph Matching.

[BibT_eX]

[DOI]

Proceedings of the Graph Based Representations in Pattern Recognition, 2003

2002

Minimal interatomic distance in Morse clusters.

[BibT_eX]

[DOI]

J. Glob. Optim., 2002

Packing equal circles in a square: a deterministic global optimization approach.

[BibT_eX]

[DOI]

Ulrich Raber

Discret. Appl. Math., 2002

Fast Global Optimization of Difficult Lennard-Jones Clusters.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2002

2001

Convergence and first hitting time of simulated annealing algorithms for continuous global optimization.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2001

2000

Finite Exact Branch-and-Bound Algorithms for Concave Minimization over Polytopes.

[BibT_eX]

[DOI]

Nguyen V. Thoai

J. Glob. Optim., 2000

Convergence of a Simulated Annealing Algorithm for Continuous Global Optimization.

[BibT_eX]

[DOI]

J. Glob. Optim., 2000

1999

Random Linkage: a family of acceptance/rejection algorithms for global optimisation.

[BibT_eX]

[DOI]

Math. Program., 1999

Finiteness of conical algorithms with ω-subdivisions.

[BibT_eX]

[DOI]

Math. Program., 1999

1998

Relaxing the Assumptions of the Multilevel Single Linkage Algorithm.

[BibT_eX]

[DOI]

J. Glob. Optim., 1998

1997

Bayesian Algorithms for One-Dimensional Global Optimization.

[BibT_eX]

[DOI]

J. Glob. Optim., 1997

1996

Simple linkage: Analysis of a threshold-accepting global optimization method.

[BibT_eX]

[DOI]

J. Glob. Optim., 1996

1995

An adaptive stochastic global optimization algorithm for one-dimensional functions.

[BibT_eX]

[DOI]