Marco Locatelli

149 papers B 2C 1Misc 1Journal 119Unranked 24

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A convex reformulation for speed planning of a vehicle under the travel time and energy consumption objectives. Autom. Luca Consolini, Mattia Laurini, Marco Locatelli
2026	J	`jnl`	Clusterwise linear regression using a probabilistic branch and bound algorithm under Gaussianity. Comput. Oper. Res. A. Fois, L. Insolia, Luca Consolini, F. Laurini, Marco Locatelli, M. Riani
2025	J	`jnl`	Fix and bound: an efficient approach for solving large-scale quadratic programming problems with box constraints. Math. Program. Comput. Marco Locatelli, Veronica Piccialli, Antonio Maria Sudoso
2025	—	`conf`	Generalized Least Squares for Vehicle Traffic Estimation. MED Mattia Laurini, Irene Saccani, Nadia Naz, Stefano Ardizzoni, Luca Consolini, Marco Locatelli
2025	J	`jnl`	Mathematical models and heuristic algorithms for pallet building problems with practical constraints. Ann. Oper. Res. Gabriele Calzavara, Manuel Iori, Marco Locatelli, Mayron César O. Moreira, Tiago Silveira
2025	J	`jnl`	Multi-agent pathfinding on strongly connected digraphs: Feasibility and solution algorithms. Artif. Intell. Stefano Ardizzoni, Luca Consolini, Marco Locatelli, Bernhard Nebel, Irene Saccani
2025	—	`conf`	Optimization methods to improve the quality of a cycling network under budget constraints. CDC Rafael Praxedes, Anand Subramanian, Stefano Ardizzoni, Luca Consolini, Mattia Laurini, Marco Locatelli
2025	J	`jnl`	Special Issue: Global Optimization. Math. Program. Tibor Csendes, Boglárka G.-Tóth, Marco Locatelli
2025	J	`jnl`	Speed planning by minimizing travel time and energy consumption. EURO J. Comput. Optim. Stefano Ardizzoni, Luca Consolini, Mattia Laurini, Marco Locatelli
2024	—	`conf`	A Branch and Bound method for the exact parameter identification of the PK/PD model for anesthetic drugs. CDC Giulia Di Credico, Luca Consolini, Mattia Laurini, Marco Locatelli, Marco Milanesi, Michele Schiavo, Antonio Visioli
2024	J	`jnl`	A Branch and Bound method for the exact parameter identification of the PK/PD model for anesthetic drugs. CoRR Giulia Di Credico, Luca Consolini, Mattia Laurini, Marco Locatelli, Marco Milanesi, Michele Schiavo, Antonio Visioli
2024	J	`jnl`	A Dynamic Programming Approach for Cooperative Pallet-Loading Manipulators. IEEE Trans Autom. Sci. Eng. Luca Consolini, Mattia Laurini, Marco Locatelli
2024	—	`conf`	A Dynamic Programming Approach for Road Traffic Estimation. CDC Mattia Laurini, Irene Saccani, Stefano Ardizzoni, Luca Consolini, Marco Locatelli
2024	J	`jnl`	A Dynamic Programming Approach for Road Traffic Estimation. CoRR Mattia Laurini, Irene Saccani, Stefano Ardizzoni, Luca Consolini, Marco Locatelli
2024	J	`jnl`	A new approach to the multiple obnoxious facility location problem based on combinatorial and continuous tools. Optim. Lett. Marco Locatelli
2024	J	`jnl`	A new technique to derive tight convex underestimators (sometimes envelopes). Comput. Optim. Appl. Marco Locatelli
2024	J	`jnl`	An Algorithm with Improved Complexity for Pebble Motion/Multi-Agent Path Finding on Trees. J. Artif. Intell. Res. Stefano Ardizzoni, Irene Saccani, Luca Consolini, Marco Locatelli, Bernhard Nebel
2024	J	`jnl`	Constrained Motion Planning and Multi-Agent Path Finding on directed graphs. Autom. Stefano Ardizzoni, Luca Consolini, Marco Locatelli, Irene Saccani
2024	J	`jnl`	Dynamic Programming based Local Search approaches for Multi-Agent Path Finding problems on Directed Graphs. CoRR Irene Saccani, Stefano Ardizzoni, Luca Consolini, Marco Locatelli
2024	—	`conf`	Identification of Cyclists' Route Choice Criteria. CDC Stefano Ardizzoni, Mattia Laurini, Rafael Praxedes, Luca Consolini, Marco Locatelli
2024	J	`jnl`	Is time-optimal speed planning under jerk constraints a convex problem? Autom. Luca Consolini, Marco Locatelli
2024	J	`jnl`	Partitioned least squares. Mach. Learn. Roberto Esposito, Mattia Cerrato, Marco Locatelli
2024	J	`jnl`	Tool switching problems with tool order constraints. Discret. Appl. Math. Manuel Iori, Alberto Locatelli, Marco Locatelli, Juan José Salazar González
2023	J	`jnl`	A GRASP for a real-world scheduling problem with unrelated parallel print machines and sequence-dependent setup times. Int. J. Prod. Res. Manuel Iori, Alberto Locatelli, Marco Locatelli
2023	J	`jnl`	An algorithm with improved complexity for pebble motion/multi-agent path finding on trees. CoRR Stefano Ardizzoni, Irene Saccani, Luca Consolini, Marco Locatelli, Bernhard Nebel
2023	J	`jnl`	KKT-based primal-dual exactness conditions for the Shor relaxation. J. Glob. Optim. Marco Locatelli
2023	—	`conf`	Local Optimization of MAPF Solutions on Directed Graphs. CDC Stefano Ardizzoni, Irene Saccani, Luca Consolini, Marco Locatelli
2023	—	`conf`	Setup Time Prediction Using Machine Learning Algorithms: A Real-World Case Study. APMS (3) Alberto Locatelli, Manuel Iori, Marco Lippi, Marco Locatelli
2023	J	`jnl`	Sharp and Fast Bounds for the Celis-Dennis-Tapia Problem. SIAM J. Optim. Luca Consolini, Marco Locatelli
2023	J	`jnl`	Solution Algorithms for the Bounded Acceleration Shortest Path Problem. IEEE Trans. Autom. Control. Stefano Ardizzoni, Luca Consolini, Mattia Laurini, Marco Locatelli
2022	J	`jnl`	A Sequential Algorithm for Jerk Limited Speed Planning. IEEE Trans Autom. Sci. Eng. Luca Consolini, Marco Locatelli, Andrea Minari
2022	J	`jnl`	A computational study on QP problems with general linear constraints. Optim. Lett. Giampaolo Liuzzi, Marco Locatelli, Veronica Piccialli
2022	J	`jnl`	Constrained Multi-Agent Path Finding on Directed Graphs. CoRR Stefano Ardizzoni, Luca Consolini, Marco Locatelli, Irene Saccani
2022	J	`jnl`	Exact and approximate results for convex envelopes of special structured functions over simplices. J. Glob. Optim. Marco Locatelli
2022	—	`conf`	Multi-Agent Path Finding on Strongly Connected Digraphs. CDC Stefano Ardizzoni, Irene Saccani, Luca Consolini, Marco Locatelli
2022	J	`jnl`	Multi-Agent Path Finding on Strongly Connected Digraphs: feasibility and solution algorithms. CoRR Stefano Ardizzoni, Irene Saccani, Luca Consolini, Marco Locatelli
2022	J	`jnl`	Shortest path with acceleration constraints: complexity and approximation algorithms. Comput. Optim. Appl. Stefano Ardizzoni, Luca Consolini, Mattia Laurini, Marco Locatelli
2022	C	`conf`	Tool Switching Problems in the Context of Overlay Printing with Multiple Colours. ISCO Manuel Iori, Alberto Locatelli, Marco Locatelli, Juan José Salazar González
2021	J	`jnl`	(Global) Optimization: Historical notes and recent developments. EURO J. Comput. Optim. Marco Locatelli, Fabio Schoen
2021	J	`jnl`	A Graph-Based Algorithm for Optimal Control of Switched Systems: An Application to Car Parking. IEEE Trans. Autom. Control. Mattia Laurini, Luca Consolini, Marco Locatelli
2021	J	`jnl`	Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems. Comput. Optim. Appl. Giampaolo Liuzzi, Marco Locatelli, Veronica Piccialli, Stefan Rass
2021	—	`conf`	Efficient solution algorithms for the Bounded Acceleration Shortest Path problem. CDC Stefano Ardizzoni, Luca Consolini, Mattia Laurini, Marco Locatelli
2021	J	`jnl`	Optimizing Cooperative Pallet Loading Robots: A Mixed Integer Approach. IEEE Robotics Autom. Lett. Mattia Laurini, Luca Consolini, Marco Locatelli
2021	—	`conf`	Scheduling of Parallel Print Machines with Sequence-Dependent Setup Costs: A Real-World Case Study. APMS (2) Manuel Iori, Alberto Locatelli, Marco Locatelli
2021	J	`jnl`	The Bounded Acceleration Shortest Path problem: complexity and solution algorithms. CoRR Stefano Ardizzoni, Luca Consolini, Mattia Laurini, Marco Locatelli
2020	—	`conf`	A Mixed Approach for Pallet Building Problem with Practical Constraints. ICEIS (Revised Selected Papers) Manuel Iori, Marco Locatelli, Mayron César O. Moreira, Tiago Silveira
2020	J	`jnl`	A solution of the minimum-time speed planning problem based on lattice theory. J. Frankl. Inst. Luca Consolini, Mattia Laurini, Marco Locatelli, Andrea Minari
2020	J	`jnl`	Convergence Analysis of Spatial-Sampling-Based Algorithms for Time-Optimal Smooth Velocity Planning. J. Optim. Theory Appl. Luca Consolini, Mattia Laurini, Marco Locatelli, Federico Cabassi
2020	J	`jnl`	Convex envelope of bivariate cubic functions over rectangular regions. J. Glob. Optim. Marco Locatelli
2020	J	`jnl`	Efficient local search procedures for quadratic fractional programming problems. Comput. Optim. Appl. Luca Consolini, Marco Locatelli, Jiulin Wang, Yong Xia
2020	—	`conf`	Fast numerical solution of optimal control problems for switched systems: An application to path planning. CDC Mattia Laurini, Luca Consolini, Marco Locatelli
2020	J	`jnl`	Partitioned Least Squares. CoRR Roberto Esposito, Mattia Cerrato, Marco Locatelli
2020	—	`conf`	Reactive GRASP-Based Algorithm for Pallet Building Problem with Visibility and Contiguity Constraints. ICCL Manuel Iori, Marco Locatelli, Mayron César O. Moreira, Tiago Silveira
2020	—	`conf`	Solution of a Practical Pallet Building Problem with Visibility and Contiguity Constraints. ICEIS (1) Manuel Iori, Marco Locatelli, Mayron César O. Moreira, Tiago Silveira
2019	J	`jnl`	A new branch-and-bound algorithm for standard quadratic programming problems. Optim. Methods Softw. Giampaolo Liuzzi, Marco Locatelli, Veronica Piccialli
2019	J	`jnl`	Globally Optimal Registration based on Fast Branch and Bound. CoRR Luca Consolini, Mattia Laurini, Marco Locatelli, Dario Lodi Rizzini
2019	J	`jnl`	Graph-based algorithms for the efficient solution of optimization problems involving monotone functions. Comput. Optim. Appl. Luca Consolini, Mattia Laurini, Marco Locatelli
2019	J	`jnl`	Optimal Time-Complexity Speed Planning for Robot Manipulators. IEEE Trans. Robotics Luca Consolini, Marco Locatelli, Andrea Minari, Ákos Nagy, István Vajk
2019	—	`conf`	Partitioned Least Squares. AI*IA Roberto Esposito, Mattia Cerrato, Marco Locatelli
2018	—	`conf`	A Multigraph-Based Selective Update Method for the Efficient Solution of Dynamic Programming. CDC Mattia Laurini, Luca Consolini, Marco Locatelli
2018	J	`jnl`	Convex envelopes of bivariate functions through the solution of KKT systems. J. Glob. Optim. Marco Locatelli
2018	J	`jnl`	Convex envelopes of separable functions over regions defined by separable functions of the same type. Optim. Lett. Marco Locatelli
2018	J	`jnl`	Optimal time-complexity speed planning for robot manipulators. CoRR Luca Consolini, Marco Locatelli, Andrea Minari, Ákos Nagy, István Vajk
2018	J	`jnl`	Time-optimal velocity planning by a bound-tightening technique. Comput. Optim. Appl. Federico Cabassi, Luca Consolini, Marco Locatelli
2017	—	`conf`	A branch and bound approach for a class of non-convex problems with applications to robust regression. MED Francesco Denaro, Luca Consolini, Marco Locatelli
2017	J	`jnl`	An optimal complexity algorithm for minimum-time velocity planning. Syst. Control. Lett. Luca Consolini, Marco Locatelli, Andrea Minari, Aurelio Piazzi
2017	J	`jnl`	Corrigendum to "An optimal complexity algorithm for minimum-time velocity planning" [Systems & Control Letters 103 (2017) 50-57]. Syst. Control. Lett. Luca Consolini, Marco Locatelli, Andrea Minari, Aurelio Piazzi
2017	J	`jnl`	On the Complexity of Optimal Power Allocation in a Multi-Tone Multiuser Communication System. IEEE Trans. Inf. Theory Marco Locatelli, Zhi-Quan Luo
2017	J	`jnl`	On the complexity of quadratic programming with two quadratic constraints. Math. Program. Luca Consolini, Marco Locatelli
2017	—	`conf`	Path planning with limited numbers of maneuvers for automatic guided vehicles: An optimization-based approach. MED Piero Micelli, Luca Consolini, Marco Locatelli
2016	—	`conf`	A Jacobi-like acceleration for dynamic programming. CDC Mattia Laurini, Piero Micelli, Luca Consolini, Marco Locatelli
2016	—	`conf`	A linear-time algorithm for minimum-time velocity planning of autonomous vehicles. MED Luca Consolini, Marco Locatelli, Andrea Minari, Aurelio Piazzi
2016	Misc	`conf`	A real-time strategy for the management of kinematic singularities: New progresses. MMAR Marina Raineri, Corrado Guarino Lo Bianco, Marco Locatelli, Simone Perri
2016	J	`jnl`	Computational investigation of simple memetic approaches for continuous global optimization. Comput. Oper. Res. Federico Cabassi, Marco Locatelli
2016	J	`jnl`	Exactness conditions for an SDP relaxation of the extended trust region problem. Optim. Lett. Marco Locatelli
2016	J	`jnl`	Global optimization based on local searches. Ann. Oper. Res. Marco Locatelli, Fabio Schoen
2016	J	`jnl`	Non polyhedral convex envelopes for 1-convex functions. J. Glob. Optim. Marco Locatelli
2016	J	`jnl`	Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes. J. Glob. Optim. Marco Locatelli
2016	J	`jnl`	Theoretical and computational results about optimality-based domain reductions. Comput. Optim. Appl. Alberto Caprara, Marco Locatelli, Michele Monaci
2015	J	`jnl`	(Non) convergence results for the differential evolution method. Optim. Lett. Marco Locatelli, Massimiliano Vasile
2015	—	`conf`	A Computational Comparison of Memetic Differential Evolution Approaches. GECCO (Companion) Federico Cabassi, Marco Locatelli
2015	J	`jnl`	Alternative branching rules for some nonconvex problems. Optim. Methods Softw. Marco Locatelli
2015	J	`jnl`	Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex. SIAM J. Optim. Marco Locatelli
2015	J	`jnl`	Improving upper bounds for the clique number by non-valid inequalities. Math. Program. Marco Locatelli
2015	—	`conf`	Jerk bounded velocity planner for the online management of autonomous vehicles. CASE Simone Perri, Corrado Guarino Lo Bianco, Marco Locatelli
2015	J	`jnl`	Some results for quadratic problems with one or two quadratic constraints. Oper. Res. Lett. Marco Locatelli
2014	J	`jnl`	A technique to derive the analytical form of convex envelopes for some bivariate functions. J. Glob. Optim. Marco Locatelli
2014	J	`jnl`	Differential evolution methods based on local searches. Comput. Oper. Res. Marco Locatelli, Mirko Maischberger, Fabio Schoen
2014	J	`jnl`	On convex envelopes for bivariate functions over polytopes. Math. Program. Marco Locatelli, Fabio Schoen
2013	J	`jnl`	Approximation algorithm for a class of global optimization problems. J. Glob. Optim. Marco Locatelli
2013	J	`jnl`	Computing the value of the convex envelope of quadratic forms over polytopes through a semidefinite program. Oper. Res. Lett. Marco Locatelli
2013	—	`book`	Global Optimization - Theory, Algorithms, and Applications. Marco Locatelli, Fabio Schoen
2013	—	`ch.`	Global Optimization for Atomic Cluster Distance Geometry Problems. Distance Geometry Marco Locatelli, Fabio Schoen
2013	J	`jnl`	Global optimization based on local searches. 4OR Marco Locatelli, Fabio Schoen
2013	J	`jnl`	Optimization and homotopy methods for the Gibbs free energy of simple magmatic mixtures. Comput. Optim. Appl. Andrea Cassioli, Luca Consolini, Marco Locatelli, Antonella Longo
2012	J	`jnl`	Branch and cut algorithms for detecting critical nodes in undirected graphs. Comput. Optim. Appl. Marco Di Summa, Andrea Grosso, Marco Locatelli
2012	J	`jnl`	Local search based heuristics for global optimization: Atomic clusters and beyond. Eur. J. Oper. Res. Marco Locatelli, Fabio Schoen
2012	J	`jnl`	Machine learning for global optimization. Comput. Optim. Appl. Andrea Cassioli, David Di Lorenzo, Marco Locatelli, Fabio Schoen, Marco Sciandrone
2012	J	`jnl`	On the relation between concavity cuts and the surrogate dual for convex maximization problems. J. Glob. Optim. Marco Locatelli, Fabio Schoen
2012	J	`jnl`	Separable standard quadratic optimization problems. Optim. Lett. Immanuel M. Bomze, Marco Locatelli
2011	J	`jnl`	A global optimization method for the design of space trajectories. Comput. Optim. Appl. Bernardetta Addis, Andrea Cassioli, Marco Locatelli, Fabio Schoen
2011	J	`jnl`	A heuristic approach for packing identical rectangles in convex regions. Comput. Oper. Res. Andrea Cassioli, Marco Locatelli
2011	J	`jnl`	An Inflationary Differential Evolution Algorithm for Space Trajectory Optimization. IEEE Trans. Evol. Comput. Massimiliano Vasile, Edmondo A. Minisci, Marco Locatelli
2011	J	`jnl`	An inflationary differential evolution algorithm for space trajectory optimization CoRR Massimiliano Vasile, Edmondo A. Minisci, Marco Locatelli
2011	J	`jnl`	Approximation of linear fractional-multiplicative problems. Math. Program. Daniele Depetrini, Marco Locatelli
2011	J	`jnl`	Complexity of the critical node problem over trees. Comput. Oper. Res. Marco Di Summa, Andrea Grosso, Marco Locatelli
2010	J	`jnl`	Copositivity cuts for improving SDP bounds on the clique number. Math. Program. Immanuel M. Bomze, Florian Frommlet, Marco Locatelli
2010	J	`jnl`	Dissimilarity measures for population-based global optimization algorithms. Comput. Optim. Appl. Andrea Cassioli, Marco Locatelli, Fabio Schoen
2010	J	`jnl`	Global optimization problems and domain reduction strategies. Math. Program. Alberto Caprara, Marco Locatelli
2010	J	`jnl`	Solving the problem of packing equal and unequal circles in a circular container. J. Glob. Optim. Andrea Grosso, A. R. M. J. U. Jamali, Marco Locatelli, Fabio Schoen
2009	J	`jnl`	A FPTAS for a class of linear multiplicative problems. Comput. Optim. Appl. Daniele Depetrini, Marco Locatelli
2009	B	`conf`	A dynamical system perspective on evolutionary heuristics applied to space trajectory optimization problems. IEEE Congress on Evolutionary Computation Massimiliano Vasile, Edmondo A. Minisci, Marco Locatelli
2009	J	`jnl`	A heuristic approach for the max-min diversity problem based on max-clique. Comput. Oper. Res. Federico Della Croce, Andrea Grosso, Marco Locatelli
2009	J	`jnl`	A hybrid multiagent approach for global trajectory optimization. J. Glob. Optim. Massimiliano Vasile, Marco Locatelli
2009	J	`jnl`	Finding maximin latin hypercube designs by Iterated Local Search heuristics. Eur. J. Oper. Res. Andrea Grosso, A. R. M. J. U. Jamali, Marco Locatelli
2009	J	`jnl`	Global optimization of binary Lennard-Jones clusters. Optim. Methods Softw. Andrea Cassioli, Marco Locatelli, Fabio Schoen
2009	—	`conf`	RE-LIVING LAS VEGAS: A multi-user, mixed-reality edutainment environment based on the enhancement of original archival materials. VECIMS Marco Antognozzi, Andrea Bottino, Aniello De Santi, Vittoria Lera, Marco Locatelli, Daniel Cook
2009	J	`jnl`	Solving molecular distance geometry problems by global optimization algorithms. Comput. Optim. Appl. Andrea Grosso, Marco Locatelli, Fabio Schoen
2008	J	`jnl`	Disk Packing in a Square: A New Global Optimization Approach. INFORMS J. Comput. Bernardetta Addis, Marco Locatelli, Fabio Schoen
2008	J	`jnl`	Efficiently packing unequal disks in a circle. Oper. Res. Lett. Bernardetta Addis, Marco Locatelli, Fabio Schoen
2008	J	`jnl`	New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability. Math. Program. Immanuel M. Bomze, Marco Locatelli, Fabio Tardella
2008	J	`jnl`	Simple ingredients leading to very efficient heuristics for the maximum clique problem. J. Heuristics Andrea Grosso, Marco Locatelli, Wayne J. Pullan
2007	J	`jnl`	A Population-based Approach for Hard Global Optimization Problems based on Dissimilarity Measures. Math. Program. Andrea Grosso, Marco Locatelli, Fabio Schoen
2007	J	`jnl`	A new class of test functions for global optimization. J. Glob. Optim. Bernardetta Addis, Marco Locatelli
2007	J	`jnl`	An experimental analysis of a population based approach for global optimization. Comput. Optim. Appl. Andrea Grosso, Marco Locatelli, Fabio Schoen
2006	J	`jnl`	A "maximum node clustering" problem. J. Comb. Optim. Giuliana Carello, Federico Della Croce, Andrea Grosso, Marco Locatelli
2005	B	`conf`	Bidimensional Packing by Bilinear Programming. IPCO Alberto Caprara, Marco Locatelli, Michele Monaci
2005	J	`jnl`	Local optima smoothing for global optimization. Optim. Methods Softw. Bernardetta Addis, Marco Locatelli, Fabio Schoen
2005	J	`jnl`	Objective Function Features Providing Barriers to Rapid Global Optimization. J. Glob. Optim. Marco Locatelli, Graham R. Wood
2005	J	`jnl`	On the Multilevel Structure of Global Optimization Problems. Comput. Optim. Appl. Marco Locatelli
2004	J	`jnl`	Combining Swaps and Node Weights in an Adaptive Greedy Approach for the Maximum Clique Problem. J. Heuristics Andrea Grosso, Marco Locatelli, Federico Della Croce
2004	J	`jnl`	Global Optimization of Morse Clusters by Potential Energy Transformations. INFORMS J. Comput. Jonathan P. K. Doye, Robert H. Leary, Marco Locatelli, Fabio Schoen
2004	J	`jnl`	The combinatorics of pivoting for the maximum weight clique. Oper. Res. Lett. Marco Locatelli, Immanuel M. Bomze, Marcello Pelillo
2004	J	`jnl`	Undominated d.c. Decompositions of Quadratic Functions and Applications to Branch-and-Bound Approaches. Comput. Optim. Appl. Immanuel M. Bomze, Marco Locatelli
2003	J	`jnl`	A Note on the Griewank Test Function. J. Glob. Optim. Marco Locatelli
2003	J	`jnl`	Efficient Algorithms for Large Scale Global Optimization: Lennard-Jones Clusters. Comput. Optim. Appl. Marco Locatelli, Fabio Schoen
2003	—	`conf`	Swap Strategies for Graph Matching. GbRPR Paolo Fosser, Roland Glantz, Marco Locatelli, Marcello Pelillo
2002	J	`jnl`	Fast Global Optimization of Difficult Lennard-Jones Clusters. Comput. Optim. Appl. Marco Locatelli, Fabio Schoen
2002	J	`jnl`	Minimal interatomic distance in Morse clusters. J. Glob. Optim. Marco Locatelli, Fabio Schoen
2002	J	`jnl`	Packing equal circles in a square: a deterministic global optimization approach. Discret. Appl. Math. Marco Locatelli, Ulrich Raber
2001	J	`jnl`	Convergence and first hitting time of simulated annealing algorithms for continuous global optimization. Math. Methods Oper. Res. Marco Locatelli
2000	J	`jnl`	Convergence of a Simulated Annealing Algorithm for Continuous Global Optimization. J. Glob. Optim. Marco Locatelli
2000	J	`jnl`	Finite Exact Branch-and-Bound Algorithms for Concave Minimization over Polytopes. J. Glob. Optim. Marco Locatelli, Nguyen V. Thoai
1999	J	`jnl`	Finiteness of conical algorithms with ω-subdivisions. Math. Program. Marco Locatelli
1999	J	`jnl`	Random Linkage: a family of acceptance/rejection algorithms for global optimisation. Math. Program. Marco Locatelli, Fabio Schoen
1998	J	`jnl`	Relaxing the Assumptions of the Multilevel Single Linkage Algorithm. J. Glob. Optim. Marco Locatelli
1997	J	`jnl`	Bayesian Algorithms for One-Dimensional Global Optimization. J. Glob. Optim. Marco Locatelli
1996	J	`jnl`	Simple linkage: Analysis of a threshold-accepting global optimization method. J. Glob. Optim. Marco Locatelli, Fabio Schoen
1995	J	`jnl`	An adaptive stochastic global optimization algorithm for one-dimensional functions. Ann. Oper. Res. Marco Locatelli, Fabio Schoen