Marco Locatelli

  • University of Parma, Italy
  • University of Turin, Italy (1999 - 2009)
  • University of Florence, Italy (1998 - 1999)
  • University of Trier, Department of Mathematics, Germany (1997 - 1998)
  • University of Milan, Italy (PhD 1996)

According to our database1, Marco Locatelli authored at least 110 papers between 1995 and 2022.

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



In proceedings 
PhD thesis 


Online presence:



A computational study on QP problems with general linear constraints.
Optim. Lett., 2022

Exact and approximate results for convex envelopes of special structured functions over simplices.
J. Glob. Optim., 2022

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

A Graph-Based Algorithm for Optimal Control of Switched Systems: An Application to Car Parking.
IEEE Trans. Autom. Control., 2021

Optimizing Cooperative Pallet Loading Robots: A Mixed Integer Approach.
IEEE Robotics Autom. Lett., 2021

(Global) Optimization: Historical notes and recent developments.
EURO J. Comput. Optim., 2021

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

Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems.
Comput. Optim. Appl., 2021

Scheduling of Parallel Print Machines with Sequence-Dependent Setup Costs: A Real-World Case Study.
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.
Proceedings of the 2021 60th IEEE Conference on Decision and Control (CDC), 2021

Convergence Analysis of Spatial-Sampling-Based Algorithms for Time-Optimal Smooth Velocity Planning.
J. Optim. Theory Appl., 2020

Convex envelope of bivariate cubic functions over rectangular regions.
J. Glob. Optim., 2020

A solution of the minimum-time speed planning problem based on lattice theory.
J. Frankl. Inst., 2020

Efficient local search procedures for quadratic fractional programming problems.
Comput. Optim. Appl., 2020

A Mixed Approach for Pallet Building Problem with Practical Constraints.
Proceedings of the Enterprise Information Systems - 22nd International Conference, 2020

Solution of a Practical Pallet Building Problem with Visibility and Contiguity Constraints.
Proceedings of the 22nd International Conference on Enterprise Information Systems, 2020

Reactive GRASP-Based Algorithm for Pallet Building Problem with Visibility and Contiguity Constraints.
Proceedings of the Computational Logistics - 11th International Conference, 2020

Fast numerical solution of optimal control problems for switched systems: An application to path planning.
Proceedings of the 59th IEEE Conference on Decision and Control, 2020

Optimal Time-Complexity Speed Planning for Robot Manipulators.
IEEE Trans. Robotics, 2019

A new branch-and-bound algorithm for standard quadratic programming problems.
Optim. Methods Softw., 2019

Globally Optimal Registration based on Fast Branch and Bound.
CoRR, 2019

Graph-based algorithms for the efficient solution of optimization problems involving monotone functions.
Comput. Optim. Appl., 2019

Partitioned Least Squares.
Proceedings of the AI*IA 2019 - Advances in Artificial Intelligence, 2019

Convex envelopes of separable functions over regions defined by separable functions of the same type.
Optim. Lett., 2018

Convex envelopes of bivariate functions through the solution of KKT systems.
J. Glob. Optim., 2018

Time-optimal velocity planning by a bound-tightening technique.
Comput. Optim. Appl., 2018

A Multigraph-Based Selective Update Method for the Efficient Solution of Dynamic Programming.
Proceedings of the 57th IEEE Conference on Decision and Control, 2018

On the Complexity of Optimal Power Allocation in a Multi-Tone Multiuser Communication System.
IEEE Trans. Inf. Theory, 2017

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

An optimal complexity algorithm for minimum-time velocity planning.
Syst. Control. Lett., 2017

On the complexity of quadratic programming with two quadratic constraints.
Math. Program., 2017

Path planning with limited numbers of maneuvers for automatic guided vehicles: An optimization-based approach.
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.
Proceedings of the 25th Mediterranean Conference on Control and Automation, 2017

Exactness conditions for an SDP relaxation of the extended trust region problem.
Optim. Lett., 2016

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

Non polyhedral convex envelopes for 1-convex functions.
J. Glob. Optim., 2016

Computational investigation of simple memetic approaches for continuous global optimization.
Comput. Oper. Res., 2016

Theoretical and computational results about optimality-based domain reductions.
Comput. Optim. Appl., 2016

Global optimization based on local searches.
Ann. Oper. Res., 2016

A real-time strategy for the management of kinematic singularities: New progresses.
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.
Proceedings of the 24th Mediterranean Conference on Control and Automation, 2016

A Jacobi-like acceleration for dynamic programming.
Proceedings of the 55th IEEE Conference on Decision and Control, 2016

Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex.
SIAM J. Optim., 2015

Some results for quadratic problems with one or two quadratic constraints.
Oper. Res. Lett., 2015

Alternative branching rules for some nonconvex problems.
Optim. Methods Softw., 2015

(Non) convergence results for the differential evolution method.
Optim. Lett., 2015

Improving upper bounds for the clique number by non-valid inequalities.
Math. Program., 2015

A Computational Comparison of Memetic Differential Evolution Approaches.
Proceedings of the Genetic and Evolutionary Computation Conference, 2015

Jerk bounded velocity planner for the online management of autonomous vehicles.
Proceedings of the IEEE International Conference on Automation Science and Engineering, 2015

On convex envelopes for bivariate functions over polytopes.
Math. Program., 2014

A technique to derive the analytical form of convex envelopes for some bivariate functions.
J. Glob. Optim., 2014

Differential evolution methods based on local searches.
Comput. Oper. Res., 2014

Computing the value of the convex envelope of quadratic forms over polytopes through a semidefinite program.
Oper. Res. Lett., 2013

Approximation algorithm for a class of global optimization problems.
J. Glob. Optim., 2013

Optimization and homotopy methods for the Gibbs free energy of simple magmatic mixtures.
Comput. Optim. Appl., 2013

Global Optimization for Atomic Cluster Distance Geometry Problems.
Proceedings of the Distance Geometry: Theory, Methods, and Applications, 2013

Global Optimization - Theory, Algorithms, and Applications.
MOS-SIAM Series on Optimization 15, SIAM, ISBN: 978-1-61197-266-5, 2013

Separable standard quadratic optimization problems.
Optim. Lett., 2012

On the relation between concavity cuts and the surrogate dual for convex maximization problems.
J. Glob. Optim., 2012

Local search based heuristics for global optimization: Atomic clusters and beyond.
Eur. J. Oper. Res., 2012

Branch and cut algorithms for detecting critical nodes in undirected graphs.
Comput. Optim. Appl., 2012

Machine learning for global optimization.
Comput. Optim. Appl., 2012

An Inflationary Differential Evolution Algorithm for Space Trajectory Optimization.
IEEE Trans. Evol. Comput., 2011

Approximation of linear fractional-multiplicative problems.
Math. Program., 2011

Complexity of the critical node problem over trees.
Comput. Oper. Res., 2011

A heuristic approach for packing identical rectangles in convex regions.
Comput. Oper. Res., 2011

A global optimization method for the design of space trajectories.
Comput. Optim. Appl., 2011

Global optimization problems and domain reduction strategies.
Math. Program., 2010

Copositivity cuts for improving SDP bounds on the clique number.
Math. Program., 2010

Solving the problem of packing equal and unequal circles in a circular container.
J. Glob. Optim., 2010

Dissimilarity measures for population-based global optimization algorithms.
Comput. Optim. Appl., 2010

Global optimization of binary Lennard-Jones clusters.
Optim. Methods Softw., 2009

A hybrid multiagent approach for global trajectory optimization.
J. Glob. Optim., 2009

Finding maximin latin hypercube designs by Iterated Local Search heuristics.
Eur. J. Oper. Res., 2009

A heuristic approach for the max-min diversity problem based on max-clique.
Comput. Oper. Res., 2009

Solving molecular distance geometry problems by global optimization algorithms.
Comput. Optim. Appl., 2009

A FPTAS for a class of linear multiplicative problems.
Comput. Optim. Appl., 2009

RE-LIVING LAS VEGAS: A multi-user, mixed-reality edutainment environment based on the enhancement of original archival materials.
Proceedings of the IEEE International Conference on Virtual Environments, 2009

A dynamical system perspective on evolutionary heuristics applied to space trajectory optimization problems.
Proceedings of the IEEE Congress on Evolutionary Computation, 2009

Efficiently packing unequal disks in a circle.
Oper. Res. Lett., 2008

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

Disk Packing in a Square: A New Global Optimization Approach.
INFORMS J. Comput., 2008

Simple ingredients leading to very efficient heuristics for the maximum clique problem.
J. Heuristics, 2008

A Population-based Approach for Hard Global Optimization Problems based on Dissimilarity Measures.
Math. Program., 2007

A new class of test functions for global optimization.
J. Glob. Optim., 2007

An experimental analysis of a population based approach for global optimization.
Comput. Optim. Appl., 2007

A "maximum node clustering" problem.
J. Comb. Optim., 2006

Local optima smoothing for global optimization.
Optim. Methods Softw., 2005

Objective Function Features Providing Barriers to Rapid Global Optimization.
J. Glob. Optim., 2005

On the Multilevel Structure of Global Optimization Problems.
Comput. Optim. Appl., 2005

Bidimensional Packing by Bilinear Programming.
Proceedings of the Integer Programming and Combinatorial Optimization, 2005

The combinatorics of pivoting for the maximum weight clique.
Oper. Res. Lett., 2004

Global Optimization of Morse Clusters by Potential Energy Transformations.
INFORMS J. Comput., 2004

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

Undominated d.c. Decompositions of Quadratic Functions and Applications to Branch-and-Bound Approaches.
Comput. Optim. Appl., 2004

A Note on the Griewank Test Function.
J. Glob. Optim., 2003

Efficient Algorithms for Large Scale Global Optimization: Lennard-Jones Clusters.
Comput. Optim. Appl., 2003

Swap Strategies for Graph Matching.
Proceedings of the Graph Based Representations in Pattern Recognition, 2003

Minimal interatomic distance in Morse clusters.
J. Glob. Optim., 2002

Packing equal circles in a square: a deterministic global optimization approach.
Discret. Appl. Math., 2002

Fast Global Optimization of Difficult Lennard-Jones Clusters.
Comput. Optim. Appl., 2002

Convergence and first hitting time of simulated annealing algorithms for continuous global optimization.
Math. Methods Oper. Res., 2001

Finite Exact Branch-and-Bound Algorithms for Concave Minimization over Polytopes.
J. Glob. Optim., 2000

Convergence of a Simulated Annealing Algorithm for Continuous Global Optimization.
J. Glob. Optim., 2000

Random Linkage: a family of acceptance/rejection algorithms for global optimisation.
Math. Program., 1999

Finiteness of conical algorithms with ω-subdivisions.
Math. Program., 1999

Relaxing the Assumptions of the Multilevel Single Linkage Algorithm.
J. Glob. Optim., 1998

Bayesian Algorithms for One-Dimensional Global Optimization.
J. Glob. Optim., 1997

Simple linkage: Analysis of a threshold-accepting global optimization method.
J. Glob. Optim., 1996

An adaptive stochastic global optimization algorithm for one-dimensional functions.
Ann. Oper. Res., 1995