The following pages link to Marco Locatelli (Q166220):
Displaying 50 items.
- (Q161430) (redirect page) (← links)
- Theoretical and computational results about optimality-based domain reductions (Q288410) (← links)
- Non polyhedral convex envelopes for 1-convex functions (Q312465) (← links)
- Exactness conditions for an SDP relaxation of the extended trust region problem (Q315474) (← links)
- Differential evolution methods based on local searches (Q336908) (← links)
- Computational investigation of simple memetic approaches for continuous global optimization (Q342367) (← links)
- On the relation between concavity cuts and the surrogate dual for convex maximization problems (Q427376) (← links)
- Machine learning for global optimization (Q434171) (← links)
- Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes (Q524905) (← links)
- A global optimization method for the design of space trajectories (Q538297) (← links)
- Approximation of linear fractional-multiplicative problems (Q543418) (← links)
- Complexity of the critical node problem over trees (Q547128) (← links)
- (Q585688) (redirect page) (← links)
- Minimal interatomic distance in Morse clusters (Q598595) (← links)
- A heuristic approach for packing identical rectangles in convex regions (Q632680) (← links)
- The combinatorics of pivoting for the maximum weight clique. (Q703275) (← links)
- Objective function features providing barriers to rapid global optimization (Q813354) (← links)
- A hybrid multiagent approach for global trajectory optimization (Q835784) (← links)
- Solving molecular distance geometry problems by global optimization algorithms (Q842778) (← links)
- A FPTAS for a class of linear multiplicative problems (Q849090) (← links)
- A population-based approach for hard global optimization problems based on dissimilarity measures (Q879969) (← links)
- Efficiently packing unequal disks in a circle (Q924882) (← links)
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability (Q930342) (← links)
- Solving the problem of packing equal and unequal circles in a circular container (Q969742) (← links)
- Simple ingredients leading to very efficient heuristics for the maximum clique problem (Q1009196) (← links)
- A heuristic approach for the max-min diversity problem based on max-clique (Q1010298) (← links)
- Finding maximin Latin hypercube designs by iterated local search heuristics (Q1014951) (← links)
- Complexity results for some global optimization problems (Q1024247) (← links)
- Relaxing the assumptions of the multilevel single linkage algorithm (Q1265181) (← links)
- Random linkage: A family of acceptance/rejection algorithms for global sation (Q1300275) (← links)
- Bayesian algorithms for one-dimensional global optimization (Q1359044) (← links)
- Necessary and sufficient global optimality conditions for convex maximization revisited (Q1378644) (← links)
- Convergence and first hitting time of simulated annealing algorithms for continuous global optimization (Q1397005) (← links)
- A note on the Griewank test function (Q1411321) (← links)
- Efficient algorithms for large scale global optimization: Lennard-Jones clusters (Q1415484) (← links)
- Finiteness of conical algorithms with \(\omega\)-subdivisions (Q1586206) (← links)
- Packing equal circles in a square: A deterministic global optimization approach (Q1613419) (← links)
- Convex envelopes of separable functions over regions defined by separable functions of the same type (Q1634777) (← links)
- Corrigendum to: ``An optimal complexity algorithm for minimum-time velocity planning'' (Q1678564) (← links)
- Time-optimal velocity planning by a bound-tightening technique (Q1753068) (← links)
- Convex envelopes of bivariate functions through the solution of KKT systems (Q1756774) (← links)
- Separable standard quadratic optimization problems (Q1758025) (← links)
- On the multilevel structure of global optimization problems (Q1773109) (← links)
- Some results for quadratic problems with one or two quadratic constraints (Q1785624) (← links)
- Simple linkage: Analysis of a threshold-accepting global optimization method (Q1817321) (← links)
- Undominated d.c. decompositions of quadratic functions and applications to branch-and-bound approaches (Q1876594) (← links)
- An adaptive stochastic global optimization algorithm for one-dimensional functions (Q1904720) (← links)
- Local search based heuristics for global optimization: atomic clusters and beyond (Q1926903) (← links)
- Branch and cut algorithms for detecting critical nodes in undirected graphs (Q1935569) (← links)
- Approximation algorithm for a class of global optimization problems (Q1937958) (← links)
