Marco Locatelli

From MaRDI portal
Person:166220

Available identifiers

zbMath Open locatelli.marcoWikidataQ106310783 ScholiaQ106310783MaRDI QIDQ166220

List of research outcomes

PublicationDate of PublicationType
Tool switching problems with tool order constraints2024-02-27Paper
A new technique to derive tight convex underestimators (sometimes envelopes)2024-02-16Paper
Solution Algorithms for the Bounded Acceleration Shortest Path Problem2023-09-28Paper
Tool switching problems in the context of overlay printing with multiple colours2023-08-03Paper
(Global) optimization: historical notes and recent developments2023-07-12Paper
KKT-based primal-dual exactness conditions for the Shor relaxation2023-06-28Paper
Sharp and Fast Bounds for the Celis-Dennis-Tapia Problem2023-06-27Paper
Fix and Bound: An efficient approach for solving large-scale quadratic programming problems with box constraints2022-11-16Paper
Shortest path with acceleration constraints: complexity and approximation algorithms2022-10-04Paper
A computational study on QP problems with general linear constraints2022-06-10Paper
Exact and approximate results for convex envelopes of special structured functions over simplices2022-05-25Paper
A Graph-Based Algorithm for Optimal Control of Switched Systems:An Application to Car Parking2022-02-24Paper
Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems2021-08-09Paper
A sequential approach for speed planning under jerk constraints2021-05-31Paper
A solution of the minimum-time speed planning problem based on lattice theory2020-09-15Paper
Efficient local search procedures for quadratic fractional programming problems2020-04-07Paper
Convex envelope of bivariate cubic functions over rectangular regions2020-02-28Paper
Convergence analysis of spatial-sampling-based algorithms for time-optimal smooth velocity planning2020-02-26Paper
Graph-based algorithms for the efficient solution of optimization problems involving monotone functions2019-06-13Paper
A new branch-and-bound algorithm for standard quadratic programming problems2019-01-14Paper
Convex envelopes of bivariate functions through the solution of KKT systems2018-12-21Paper
Convex envelopes of separable functions over regions defined by separable functions of the same type2018-12-18Paper
Some results for quadratic problems with one or two quadratic constraints2018-10-01Paper
On the Complexity of Optimal Power Allocation in a Multi-Tone Multiuser Communication System2018-06-27Paper
Time-optimal velocity planning by a bound-tightening technique2018-05-25Paper
Corrigendum to: ``An optimal complexity algorithm for minimum-time velocity planning2017-11-17Paper
An optimal complexity algorithm for minimum-time velocity planning2017-09-29Paper
On the complexity of quadratic programming with two quadratic constraints2017-07-21Paper
Global Optimization Approaches for Optimal Trajectory Planning2017-06-29Paper
Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes2017-04-27Paper
Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex2017-01-13Paper
Computational investigation of simple memetic approaches for continuous global optimization2016-11-17Paper
Differential evolution methods based on local searches2016-11-10Paper
Exactness conditions for an SDP relaxation of the extended trust region problem2016-09-21Paper
Non polyhedral convex envelopes for 1-convex functions2016-09-15Paper
Global optimization based on local searches2016-07-22Paper
Theoretical and computational results about optimality-based domain reductions2016-05-25Paper
Alternative branching rules for some nonconvex problems2015-09-04Paper
Improving upper bounds for the clique number by non-valid inequalities2015-04-16Paper
(Non) convergence results for the differential evolution method2015-03-25Paper
A technique to derive the analytical form of convex envelopes for some bivariate functions2014-07-04Paper
On convex envelopes for bivariate functions over polytopes2014-06-02Paper
Computing the value of the convex envelope of quadratic forms over polytopes through a semidefinite program2014-05-14Paper
Global optimization based on local searches2014-03-24Paper
https://portal.mardi4nfdi.de/entity/Q28641202013-12-05Paper
Global Optimization for Atomic Cluster Distance Geometry Problems2013-07-29Paper
Optimization and homotopy methods for the Gibbs free energy of simple magmatic mixtures2013-06-26Paper
Branch and cut algorithms for detecting critical nodes in undirected graphs2013-02-18Paper
Approximation algorithm for a class of global optimization problems2013-02-01Paper
Local search based heuristics for global optimization: atomic clusters and beyond2012-12-29Paper
Separable standard quadratic optimization problems2012-11-07Paper
Disk Packing in a Square: A New Global Optimization Approach2012-07-28Paper
Machine learning for global optimization2012-07-10Paper
On the relation between concavity cuts and the surrogate dual for convex maximization problems2012-06-13Paper
Global Optimization of Morse Clusters by Potential Energy Transformations2012-06-08Paper
Complexity of the critical node problem over trees2011-06-30Paper
Approximation of linear fractional-multiplicative problems2011-06-17Paper
A global optimization method for the design of space trajectories2011-05-25Paper
A heuristic approach for packing identical rectangles in convex regions2011-03-25Paper
Gap, cosum and product properties of the θ′ bound on the clique number2011-01-20Paper
Global optimization problems and domain reduction strategies2010-10-13Paper
Copositivity cuts for improving SDP bounds on the clique number2010-09-16Paper
Solving the problem of packing equal and unequal circles in a circular container2010-05-07Paper
Dissimilarity measures for population-based global optimization algorithms2010-03-19Paper
A FPTAS for a class of linear multiplicative problems2010-02-24Paper
Solving molecular distance geometry problems by global optimization algorithms2009-09-25Paper
Global optimization of binary Lennard–Jones clusters2009-09-18Paper
A hybrid multiagent approach for global trajectory optimization2009-08-31Paper
Complexity results for some global optimization problems2009-06-16Paper
Finding maximin Latin hypercube designs by iterated local search heuristics2009-04-30Paper
A heuristic approach for the max-min diversity problem based on max-clique2009-04-03Paper
Simple ingredients leading to very efficient heuristics for the maximum clique problem2009-03-31Paper
New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability2008-06-30Paper
Efficiently packing unequal disks in a circle2008-05-29Paper
A ``maximum node clustering problem2008-04-04Paper
An experimental analysis of a population based approach for global optimization2008-03-12Paper
A new class of test functions for global optimization2007-11-14Paper
Bidimensional Packing by Bilinear Programming2007-08-30Paper
A population-based approach for hard global optimization problems based on dissimilarity measures2007-05-10Paper
Objective function features providing barriers to rapid global optimization2006-02-08Paper
Local optima smoothing for global optimization2006-01-10Paper
On the multilevel structure of global optimization problems2005-04-25Paper
The combinatorics of pivoting for the maximum weight clique.2005-01-11Paper
Undominated d.c. decompositions of quadratic functions and applications to branch-and-bound approaches2004-08-20Paper
Minimal interatomic distance in Morse clusters2004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q44529762004-03-07Paper
https://portal.mardi4nfdi.de/entity/Q44508002004-02-16Paper
Efficient algorithms for large scale global optimization: Lennard-Jones clusters2003-12-04Paper
A note on the Griewank test function2003-10-27Paper
Convergence and first hitting time of simulated annealing algorithms for continuous global optimization2003-07-16Paper
https://portal.mardi4nfdi.de/entity/Q47886342003-01-22Paper
Packing equal circles in a square: A deterministic global optimization approach2002-08-29Paper
Fast global optimization of difficult Lennard-Jones clusters2002-04-15Paper
Finite exact branch-and-bound algorithms for concave minimization over polytopes2001-05-13Paper
On convergence of the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions2001-02-19Paper
Finiteness result for the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions2001-02-19Paper
Simulated annealing algorithms for continuous global optimization: Convergence conditions2000-12-14Paper
Finiteness of conical algorithms with \(\omega\)-subdivisions2000-11-12Paper
Random linkage: A family of acceptance/rejection algorithms for global sation2000-06-04Paper
Convergence of a simulated annealing algorithm for continuous global optimization.2000-01-01Paper
Necessary and sufficient global optimality conditions for convex maximization revisited1999-04-13Paper
Relaxing the assumptions of the multilevel single linkage algorithm1998-09-27Paper
Convergence properties of simulated annealing for continuous global optimization1998-01-28Paper
https://portal.mardi4nfdi.de/entity/Q42396451998-01-01Paper
Bayesian algorithms for one-dimensional global optimization1997-10-05Paper
https://portal.mardi4nfdi.de/entity/Q43568721997-10-05Paper
Simple linkage: Analysis of a threshold-accepting global optimization method1997-04-21Paper
An adaptive stochastic global optimization algorithm for one-dimensional functions1996-07-24Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Marco Locatelli