The following pages link to Marco Locatelli (Q166220):
Displaying 50 items.
- Global optimization problems and domain reduction strategies (Q1960192) (← links)
- Simulated annealing algorithms for continuous global optimization: Convergence conditions (Q1973485) (← links)
- Efficient local search procedures for quadratic fractional programming problems (Q1986108) (← links)
- (Non) convergence results for the differential evolution method (Q2018857) (← links)
- Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems (Q2044489) (← links)
- Shortest path with acceleration constraints: complexity and approximation algorithms (Q2082550) (← links)
- Exact and approximate results for convex envelopes of special structured functions over simplices (Q2141722) (← links)
- A solution of the minimum-time speed planning problem based on lattice theory (Q2198659) (← links)
- A technique to derive the analytical form of convex envelopes for some bivariate functions (Q2250092) (← links)
- Convex envelope of bivariate cubic functions over rectangular regions (Q2301177) (← links)
- Convergence analysis of spatial-sampling-based algorithms for time-optimal smooth velocity planning (Q2302843) (← links)
- Improving upper bounds for the clique number by non-valid inequalities (Q2340341) (← links)
- On the complexity of quadratic programming with two quadratic constraints (Q2364486) (← links)
- Optimization and homotopy methods for the Gibbs free energy of simple magmatic mixtures (Q2376120) (← links)
- Dissimilarity measures for population-based global optimization algorithms (Q2379686) (← links)
- An optimal complexity algorithm for minimum-time velocity planning (Q2407231) (← links)
- Graph-based algorithms for the efficient solution of optimization problems involving monotone functions (Q2419542) (← links)
- Computing the value of the convex envelope of quadratic forms over polytopes through a semidefinite program (Q2450669) (← links)
- On convex envelopes for bivariate functions over polytopes (Q2452372) (← links)
- A new class of test functions for global optimization (Q2460145) (← links)
- An experimental analysis of a population based approach for global optimization (Q2477011) (← links)
- A ``maximum node clustering'' problem (Q2479564) (← links)
- Copositivity cuts for improving SDP bounds on the clique number (Q2638373) (← links)
- A computational study on QP problems with general linear constraints (Q2673522) (← links)
- Global Optimization for Atomic Cluster Distance Geometry Problems (Q2841707) (← links)
- Global optimization. Theory, algorithms, and applications (Q2864120) (← links)
- Global optimization of Morse clusters by potential energy transformations (Q2890438) (← links)
- Disk packing in a square: a new global optimization approach (Q2901032) (← links)
- Alternative branching rules for some nonconvex problems (Q2943824) (← links)
- Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex (Q2954391) (← links)
- Gap, cosum and product properties of the θ′ bound on the clique number (Q3066919) (← links)
- Convergence properties of simulated annealing for continuous global optimization (Q3122875) (← links)
- Global optimization of binary Lennard–Jones clusters (Q3396401) (← links)
- Bidimensional Packing by Bilinear Programming (Q3596354) (← links)
- (Q4239645) (← links)
- (Q4356872) (← links)
- (Q4450800) (← links)
- (Q4452976) (← links)
- On the Complexity of Optimal Power Allocation in a Multi-Tone Multiuser Communication System (Q4566515) (← links)
- A new branch-and-bound algorithm for standard quadratic programming problems (Q4646674) (← links)
- (Q4788634) (← links)
- A Graph-Based Algorithm for Optimal Control of Switched Systems:An Application to Car Parking (Q5033907) (← links)
- Global Optimization Approaches for Optimal Trajectory Planning (Q5270065) (← links)
- Local optima smoothing for global optimization (Q5717532) (← links)
- Global optimization based on local searches (Q5920293) (← links)
- Global optimization based on local searches (Q5925165) (← links)
- On convergence of the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions (Q5925734) (← links)
- Finiteness result for the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions (Q5925735) (← links)
- Finite exact branch-and-bound algorithms for concave minimization over polytopes (Q5927657) (← links)
- Convergence of a simulated annealing algorithm for continuous global optimization. (Q5928424) (← links)
