An adaptive stochastic global optimization algorithm for one-dimensional functions. - Marco Locatelli 001; Fabio Schoen (Ann. Oper. Res., 1995)

Simple linkage: Analysis of a threshold-accepting global optimization method. - Marco Locatelli 001; Fabio Schoen (J. Glob. Optim., 1996)

Bayesian Algorithms for One-Dimensional Global Optimization. - Marco Locatelli 001 (J. Glob. Optim., 1997)

Relaxing the Assumptions of the Multilevel Single Linkage Algorithm. - Marco Locatelli 001 (J. Glob. Optim., 1998)

Finiteness of conical algorithms with ω-subdivisions. - Marco Locatelli 001 (Math. Program., 1999)

Random Linkage: a family of acceptance/rejection algorithms for global optimisation. - Marco Locatelli 001; Fabio Schoen (Math. Program., 1999)

Convergence of a Simulated Annealing Algorithm for Continuous Global Optimization. - Marco Locatelli 001 (J. Glob. Optim., 2000)

Finite Exact Branch-and-Bound Algorithms for Concave Minimization over Polytopes. - Marco Locatelli 001; Nguyen V. Thoai (J. Glob. Optim., 2000)

Convergence and first hitting time of simulated annealing algorithms for continuous global optimization. - Marco Locatelli 001 (Math. Methods Oper. Res., 2001)

Fast Global Optimization of Difficult Lennard-Jones Clusters. - Marco Locatelli 001; Fabio Schoen (Comput. Optim. Appl., 2002)

Packing equal circles in a square: a deterministic global optimization approach. - Marco Locatelli 001; Ulrich Raber (Discret. Appl. Math., 2002)

Minimal interatomic distance in Morse clusters. - Marco Locatelli 001; Fabio Schoen (J. Glob. Optim., 2002)

Swap Strategies for Graph Matching. - Paolo Fosser; Roland Glantz; Marco Locatelli 001; Marcello Pelillo (GbRPR, 2003)

Efficient Algorithms for Large Scale Global Optimization: Lennard-Jones Clusters. - Marco Locatelli 001; Fabio Schoen (Comput. Optim. Appl., 2003)

A Note on the Griewank Test Function. - Marco Locatelli 001 (J. Glob. Optim., 2003)

Undominated d.c. Decompositions of Quadratic Functions and Applications to Branch-and-Bound Approaches. - Immanuel M. Bomze; Marco Locatelli 001 (Comput. Optim. Appl., 2004)

Combining Swaps and Node Weights in an Adaptive Greedy Approach for the Maximum Clique Problem. - Andrea Grosso; Marco Locatelli 001; Federico Della Croce (J. Heuristics, 2004)

Global Optimization of Morse Clusters by Potential Energy Transformations. - Jonathan P. K. Doye; Robert H. Leary; Marco Locatelli 001; Fabio Schoen (INFORMS J. Comput., 2004)

The combinatorics of pivoting for the maximum weight clique. - Marco Locatelli 001; Immanuel M. Bomze; Marcello Pelillo (Oper. Res. Lett., 2004)

Bidimensional Packing by Bilinear Programming. - Alberto Caprara; Marco Locatelli 001; Michele Monaci (IPCO, 2005)

On the Multilevel Structure of Global Optimization Problems. - Marco Locatelli 001 (Comput. Optim. Appl., 2005)

Objective Function Features Providing Barriers to Rapid Global Optimization. - Marco Locatelli 001; Graham R. Wood (J. Glob. Optim., 2005)

Local optima smoothing for global optimization. - Bernardetta Addis; Marco Locatelli 001; Fabio Schoen (Optim. Methods Softw., 2005)

A "maximum node clustering" problem. - Giuliana Carello; Federico Della Croce; Andrea Grosso; Marco Locatelli 001 (J. Comb. Optim., 2006)

An experimental analysis of a population based approach for global optimization. - Andrea Grosso; Marco Locatelli 001; Fabio Schoen (Comput. Optim. Appl., 2007)

A new class of test functions for global optimization. - Bernardetta Addis; Marco Locatelli 001 (J. Glob. Optim., 2007)

A Population-based Approach for Hard Global Optimization Problems based on Dissimilarity Measures. - Andrea Grosso; Marco Locatelli 001; Fabio Schoen (Math. Program., 2007)

Simple ingredients leading to very efficient heuristics for the maximum clique problem. - Andrea Grosso; Marco Locatelli 001; Wayne J. Pullan (J. Heuristics, 2008)

Disk Packing in a Square: A New Global Optimization Approach. - Bernardetta Addis; Marco Locatelli 001; Fabio Schoen (INFORMS J. Comput., 2008)

New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability. - Immanuel M. Bomze; Marco Locatelli 001; Fabio Tardella (Math. Program., 2008)

Efficiently packing unequal disks in a circle. - Bernardetta Addis; Marco Locatelli 001; Fabio Schoen (Oper. Res. Lett., 2008)

A dynamical system perspective on evolutionary heuristics applied to space trajectory optimization problems. - Massimiliano Vasile; Edmondo A. Minisci; Marco Locatelli 001 (IEEE Congress on Evolutionary Computation, 2009)

RE-LIVING LAS VEGAS: A multi-user, mixed-reality edutainment environment based on the enhancement of original archival materials. - Marco Antognozzi; Andrea Bottino; Aniello De Santi; Vittoria Lera; Marco Locatelli 001; Daniel Cook (VECIMS, 2009)

A FPTAS for a class of linear multiplicative problems. - Daniele Depetrini; Marco Locatelli 001 (Comput. Optim. Appl., 2009)

Solving molecular distance geometry problems by global optimization algorithms. - Andrea Grosso; Marco Locatelli 001; Fabio Schoen (Comput. Optim. Appl., 2009)

A heuristic approach for the max-min diversity problem based on max-clique. - Federico Della Croce; Andrea Grosso; Marco Locatelli 001 (Comput. Oper. Res., 2009)

Finding maximin latin hypercube designs by Iterated Local Search heuristics. - Andrea Grosso; A. R. M. J. U. Jamali; Marco Locatelli 001 (Eur. J. Oper. Res., 2009)

A hybrid multiagent approach for global trajectory optimization. - Massimiliano Vasile; Marco Locatelli 001 (J. Glob. Optim., 2009)

Global optimization of binary Lennard-Jones clusters. - Andrea Cassioli; Marco Locatelli 001; Fabio Schoen (Optim. Methods Softw., 2009)

Dissimilarity measures for population-based global optimization algorithms. - Andrea Cassioli; Marco Locatelli 001; Fabio Schoen (Comput. Optim. Appl., 2010)

Solving the problem of packing equal and unequal circles in a circular container. - Andrea Grosso; A. R. M. J. U. Jamali; Marco Locatelli 001; Fabio Schoen (J. Glob. Optim., 2010)

Copositivity cuts for improving SDP bounds on the clique number. - Immanuel M. Bomze; Florian Frommlet; Marco Locatelli 001 (Math. Program., 2010)

Global optimization problems and domain reduction strategies. - Alberto Caprara; Marco Locatelli 001 (Math. Program., 2010)

A global optimization method for the design of space trajectories. - Bernardetta Addis; Andrea Cassioli; Marco Locatelli 001; Fabio Schoen (Comput. Optim. Appl., 2011)

A heuristic approach for packing identical rectangles in convex regions. - Andrea Cassioli; Marco Locatelli 001 (Comput. Oper. Res., 2011)

Complexity of the critical node problem over trees. - Marco Di Summa; Andrea Grosso; Marco Locatelli 001 (Comput. Oper. Res., 2011)

Approximation of linear fractional-multiplicative problems. - Daniele Depetrini; Marco Locatelli 001 (Math. Program., 2011)

An Inflationary Differential Evolution Algorithm for Space Trajectory Optimization. - Massimiliano Vasile; Edmondo A. Minisci; Marco Locatelli 001 (IEEE Trans. Evol. Comput., 2011)

Machine learning for global optimization. - Andrea Cassioli; David Di Lorenzo; Marco Locatelli 001; Fabio Schoen; Marco Sciandrone (Comput. Optim. Appl., 2012)

Branch and cut algorithms for detecting critical nodes in undirected graphs. - Marco Di Summa; Andrea Grosso; Marco Locatelli 001 (Comput. Optim. Appl., 2012)

Local search based heuristics for global optimization: Atomic clusters and beyond. - Marco Locatelli 001; Fabio Schoen (Eur. J. Oper. Res., 2012)

On the relation between concavity cuts and the surrogate dual for convex maximization problems. - Marco Locatelli 001; Fabio Schoen (J. Glob. Optim., 2012)

Separable standard quadratic optimization problems. - Immanuel M. Bomze; Marco Locatelli 001 (Optim. Lett., 2012)

Global Optimization - Theory, Algorithms, and Applications. - Marco Locatelli 001; Fabio Schoen (SIAM, 2013)

Global Optimization for Atomic Cluster Distance Geometry Problems. - Marco Locatelli 001; Fabio Schoen (Distance Geometry, 2013)

Global optimization based on local searches. - Marco Locatelli 001; Fabio Schoen (4OR, 2013)

Optimization and homotopy methods for the Gibbs free energy of simple magmatic mixtures. - Andrea Cassioli; Luca Consolini; Marco Locatelli 001; Antonella Longo (Comput. Optim. Appl., 2013)

Approximation algorithm for a class of global optimization problems. - Marco Locatelli 001 (J. Glob. Optim., 2013)

Computing the value of the convex envelope of quadratic forms over polytopes through a semidefinite program. - Marco Locatelli 001 (Oper. Res. Lett., 2013)

Differential evolution methods based on local searches. - Marco Locatelli 001; Mirko Maischberger; Fabio Schoen (Comput. Oper. Res., 2014)

A technique to derive the analytical form of convex envelopes for some bivariate functions. - Marco Locatelli 001 (J. Glob. Optim., 2014)

On convex envelopes for bivariate functions over polytopes. - Marco Locatelli 001; Fabio Schoen (Math. Program., 2014)

Jerk bounded velocity planner for the online management of autonomous vehicles. - Simone Perri; Corrado Guarino Lo Bianco; Marco Locatelli 001 (CASE, 2015)

A Computational Comparison of Memetic Differential Evolution Approaches. - Federico Cabassi; Marco Locatelli 001 (GECCO (Companion), 2015)

Improving upper bounds for the clique number by non-valid inequalities. - Marco Locatelli 001 (Math. Program., 2015)

(Non) convergence results for the differential evolution method. - Marco Locatelli 001; Massimiliano Vasile (Optim. Lett., 2015)

Alternative branching rules for some nonconvex problems. - Marco Locatelli 001 (Optim. Methods Softw., 2015)

Some results for quadratic problems with one or two quadratic constraints. - Marco Locatelli 001 (Oper. Res. Lett., 2015)

Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex. - Marco Locatelli 001 (SIAM J. Optim., 2015)

A Jacobi-like acceleration for dynamic programming. - Mattia Laurini; Piero Micelli; Luca Consolini; Marco Locatelli 001 (CDC, 2016)

A linear-time algorithm for minimum-time velocity planning of autonomous vehicles. - Luca Consolini; Marco Locatelli 001; Andrea Minari; Aurelio Piazzi (MED, 2016)

A real-time strategy for the management of kinematic singularities: New progresses. - Marina Raineri; Corrado Guarino Lo Bianco; Marco Locatelli 001; Simone Perri (MMAR, 2016)

Theoretical and computational results about optimality-based domain reductions. - Alberto Caprara; Marco Locatelli 001; Michele Monaci (Comput. Optim. Appl., 2016)

Computational investigation of simple memetic approaches for continuous global optimization. - Federico Cabassi; Marco Locatelli 001 (Comput. Oper. Res., 2016)

Non polyhedral convex envelopes for 1-convex functions. - Marco Locatelli 001 (J. Glob. Optim., 2016)

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

Exactness conditions for an SDP relaxation of the extended trust region problem. - Marco Locatelli 001 (Optim. Lett., 2016)

A branch and bound approach for a class of non-convex problems with applications to robust regression. - Francesco Denaro; Luca Consolini; Marco Locatelli 001 (MED, 2017)

Path planning with limited numbers of maneuvers for automatic guided vehicles: An optimization-based approach. - Piero Micelli; Luca Consolini; Marco Locatelli 001 (MED, 2017)

On the complexity of quadratic programming with two quadratic constraints. - Luca Consolini; Marco Locatelli 001 (Math. Program., 2017)

An optimal complexity algorithm for minimum-time velocity planning. - Luca Consolini; Marco Locatelli 001; Andrea Minari; Aurelio Piazzi (Syst. Control. Lett., 2017)

Corrigendum to "An optimal complexity algorithm for minimum-time velocity planning" [Systems & Control Letters 103 (2017) 50-57]. - Luca Consolini; Marco Locatelli 001; Andrea Minari; Aurelio Piazzi (Syst. Control. Lett., 2017)

On the Complexity of Optimal Power Allocation in a Multi-Tone Multiuser Communication System. - Marco Locatelli 001; Zhi-Quan Luo (IEEE Trans. Inf. Theory, 2017)

A Multigraph-Based Selective Update Method for the Efficient Solution of Dynamic Programming. - Mattia Laurini; Luca Consolini; Marco Locatelli 001 (CDC, 2018)

Time-optimal velocity planning by a bound-tightening technique. - Federico Cabassi; Luca Consolini; Marco Locatelli 001 (Comput. Optim. Appl., 2018)

Convex envelopes of bivariate functions through the solution of KKT systems. - Marco Locatelli 001 (J. Glob. Optim., 2018)

Convex envelopes of separable functions over regions defined by separable functions of the same type. - Marco Locatelli 001 (Optim. Lett., 2018)

Graph-based algorithms for the efficient solution of optimization problems involving monotone functions. - Luca Consolini; Mattia Laurini; Marco Locatelli 001 (Comput. Optim. Appl., 2019)

Globally Optimal Registration based on Fast Branch and Bound. - Luca Consolini; Mattia Laurini; Marco Locatelli 001; Dario Lodi Rizzini (CoRR, 2019)

A new branch-and-bound algorithm for standard quadratic programming problems. - Giampaolo Liuzzi; Marco Locatelli 001; Veronica Piccialli (Optim. Methods Softw., 2019)

Optimal Time-Complexity Speed Planning for Robot Manipulators. - Luca Consolini; Marco Locatelli 001; Andrea Minari; Ákos Nagy; István Vajk (IEEE Trans. Robotics, 2019)

Fast numerical solution of optimal control problems for switched systems: An application to path planning. - Mattia Laurini; Luca Consolini; Marco Locatelli 001 (CDC, 2020)

Reactive GRASP-Based Algorithm for Pallet Building Problem with Visibility and Contiguity Constraints. - Manuel Iori; Marco Locatelli 001; Mayron César O. Moreira; Tiago Silveira (ICCL, 2020)

Solution of a Practical Pallet Building Problem with Visibility and Contiguity Constraints. - Manuel Iori; Marco Locatelli 001; Mayron César O. Moreira; Tiago Silveira (ICEIS (1), 2020)

A Mixed Approach for Pallet Building Problem with Practical Constraints. - Manuel Iori; Marco Locatelli 001; Mayron César O. Moreira; Tiago Silveira (ICEIS (Revised Selected Papers), 2020)

Efficient local search procedures for quadratic fractional programming problems. - Luca Consolini; Marco Locatelli 001; Jiulin Wang; Yong Xia 002 (Comput. Optim. Appl., 2020)

A solution of the minimum-time speed planning problem based on lattice theory. - Luca Consolini; Mattia Laurini; Marco Locatelli 001; Andrea Minari (J. Frankl. Inst., 2020)

Convex envelope of bivariate cubic functions over rectangular regions. - Marco Locatelli 001 (J. Glob. Optim., 2020)

Convergence Analysis of Spatial-Sampling-Based Algorithms for Time-Optimal Smooth Velocity Planning. - Luca Consolini; Mattia Laurini; Marco Locatelli 001; Federico Cabassi (J. Optim. Theory Appl., 2020)

Efficient solution algorithms for the Bounded Acceleration Shortest Path problem. - Stefano Ardizzoni; Luca Consolini; Mattia Laurini; Marco Locatelli 001 (CDC, 2021)

Scheduling of Parallel Print Machines with Sequence-Dependent Setup Costs: A Real-World Case Study. - Manuel Iori; Alberto Locatelli; Marco Locatelli 001 (APMS (2), 2021)

Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems. - Giampaolo Liuzzi; Marco Locatelli 001; Veronica Piccialli; Stefan Rass (Comput. Optim. Appl., 2021)

The Bounded Acceleration Shortest Path problem: complexity and solution algorithms. - Stefano Ardizzoni; Luca Consolini; Mattia Laurini; Marco Locatelli 001 (CoRR, 2021)

(Global) Optimization: Historical notes and recent developments. - Marco Locatelli 001; Fabio Schoen (EURO J. Comput. Optim., 2021)

Optimizing Cooperative Pallet Loading Robots: A Mixed Integer Approach. - Mattia Laurini; Luca Consolini; Marco Locatelli 001 (IEEE Robotics Autom. Lett., 2021)

A Graph-Based Algorithm for Optimal Control of Switched Systems: An Application to Car Parking. - Mattia Laurini; Luca Consolini; Marco Locatelli 001 (IEEE Trans. Autom. Control., 2021)

Multi-Agent Path Finding on Strongly Connected Digraphs. - Stefano Ardizzoni; Irene Saccani; Luca Consolini; Marco Locatelli 001 (CDC, 2022)

Tool Switching Problems in the Context of Overlay Printing with Multiple Colours. - Manuel Iori; Alberto Locatelli; Marco Locatelli 001; Juan José Salazar González (ISCO, 2022)

Shortest path with acceleration constraints: complexity and approximation algorithms. - Stefano Ardizzoni; Luca Consolini; Mattia Laurini; Marco Locatelli 001 (Comput. Optim. Appl., 2022)

Multi-Agent Path Finding on Strongly Connected Digraphs: feasibility and solution algorithms. - Stefano Ardizzoni; Irene Saccani; Luca Consolini; Marco Locatelli 001 (CoRR, 2022)

Constrained Multi-Agent Path Finding on Directed Graphs. - Stefano Ardizzoni; Luca Consolini; Marco Locatelli 001; Irene Saccani (CoRR, 2022)

Exact and approximate results for convex envelopes of special structured functions over simplices. - Marco Locatelli 001 (J. Glob. Optim., 2022)

A computational study on QP problems with general linear constraints. - Giampaolo Liuzzi; Marco Locatelli 001; Veronica Piccialli (Optim. Lett., 2022)

A Sequential Algorithm for Jerk Limited Speed Planning. - Luca Consolini; Marco Locatelli 001; Andrea Minari (IEEE Trans Autom. Sci. Eng., 2022)

Local Optimization of MAPF Solutions on Directed Graphs. - Stefano Ardizzoni; Irene Saccani; Luca Consolini; Marco Locatelli 001 (CDC, 2023)

Setup Time Prediction Using Machine Learning Algorithms: A Real-World Case Study. - Alberto Locatelli; Manuel Iori; Marco Lippi 001; Marco Locatelli 001 (APMS (3), 2023)

Solution Algorithms for the Bounded Acceleration Shortest Path Problem. - Stefano Ardizzoni; Luca Consolini; Mattia Laurini; Marco Locatelli 001 (IEEE Trans. Autom. Control., 2023)

KKT-based primal-dual exactness conditions for the Shor relaxation. - Marco Locatelli 001 (J. Glob. Optim., 2023)

Sharp and Fast Bounds for the Celis-Dennis-Tapia Problem. - Luca Consolini; Marco Locatelli 001 (SIAM J. Optim., 2023)

A GRASP for a real-world scheduling problem with unrelated parallel print machines and sequence-dependent setup times. - Manuel Iori; Alberto Locatelli; Marco Locatelli 001 (Int. J. Prod. Res., 2023)

Identification of Cyclists' Route Choice Criteria. - Stefano Ardizzoni; Mattia Laurini; Rafael Praxedes; Luca Consolini; Marco Locatelli 001 (CDC, 2024)

A Branch and Bound method for the exact parameter identification of the PK/PD model for anesthetic drugs. - Giulia Di Credico; Luca Consolini; Mattia Laurini; Marco Locatelli 001; Marco Milanesi; Michele Schiavo; Antonio Visioli (CDC, 2024)

A Dynamic Programming Approach for Road Traffic Estimation. - Mattia Laurini; Irene Saccani; Stefano Ardizzoni; Luca Consolini; Marco Locatelli 001 (CDC, 2024)

Constrained Motion Planning and Multi-Agent Path Finding on directed graphs. - Stefano Ardizzoni; Luca Consolini; Marco Locatelli 001; Irene Saccani (Autom., 2024)

Is time-optimal speed planning under jerk constraints a convex problem? - Luca Consolini; Marco Locatelli 001 (Autom., 2024)

Dynamic Programming based Local Search approaches for Multi-Agent Path Finding problems on Directed Graphs. - Irene Saccani; Stefano Ardizzoni; Luca Consolini; Marco Locatelli 001 (CoRR, 2024)

Tool switching problems with tool order constraints. - Manuel Iori; Alberto Locatelli; Marco Locatelli 001; Juan José Salazar González (Discret. Appl. Math., 2024)

An Algorithm with Improved Complexity for Pebble Motion/Multi-Agent Path Finding on Trees. - Stefano Ardizzoni; Irene Saccani; Luca Consolini; Marco Locatelli 001; Bernhard Nebel (J. Artif. Intell. Res., 2024)

A new technique to derive tight convex underestimators (sometimes envelopes). - Marco Locatelli 001 (Comput. Optim. Appl., 2024)

A new approach to the multiple obnoxious facility location problem based on combinatorial and continuous tools. - Marco Locatelli 001 (Optim. Lett., 2024)

Partitioned least squares. - Roberto Esposito; Mattia Cerrato; Marco Locatelli 001 (Mach. Learn., 2024)

A Dynamic Programming Approach for Cooperative Pallet-Loading Manipulators. - Luca Consolini; Mattia Laurini; Marco Locatelli 001 (IEEE Trans Autom. Sci. Eng., 2024)

Generalized Least Squares for Vehicle Traffic Estimation. - Mattia Laurini; Irene Saccani; Nadia Naz; Stefano Ardizzoni; Luca Consolini; Marco Locatelli 001 (MED, 2025)

Multi-agent pathfinding on strongly connected digraphs: Feasibility and solution algorithms. - Stefano Ardizzoni; Luca Consolini; Marco Locatelli 001; Bernhard Nebel; Irene Saccani (Artif. Intell., 2025)

Speed planning by minimizing travel time and energy consumption. - Stefano Ardizzoni; Luca Consolini; Mattia Laurini; Marco Locatelli 001 (EURO J. Comput. Optim., 2025)

Special Issue: Global Optimization. - Tibor Csendes; Boglárka G.-Tóth; Marco Locatelli 001 (Math. Program., 2025)

Fix and bound: an efficient approach for solving large-scale quadratic programming problems with box constraints. - Marco Locatelli 001; Veronica Piccialli; Antonio Maria Sudoso (Math. Program. Comput., 2025)

Mathematical models and heuristic algorithms for pallet building problems with practical constraints. - Gabriele Calzavara; Manuel Iori; Marco Locatelli 001; Mayron César O. Moreira; Tiago Silveira (Ann. Oper. Res., 2025)