Solving molecular distance geometry problems by global optimization algorithms
| Year of publication: |
2009
|
|---|---|
| Authors: | Grosso, Andrea ; Locatelli, Marco ; Schoen, Fabio |
| Published in: |
Computational Optimization and Applications. - Springer. - Vol. 43.2009, 1, p. 23-37
|
| Publisher: |
Springer |
| Subject: | Global optimization | Distance geometry | Multistart | Basin hopping |
-
A global optimization method for the design of space trajectories
Addis, Bernardetta, (2011)
-
Local search based heuristics for global optimization: Atomic clusters and beyond
Locatelli, Marco, (2012)
-
SOMS: SurrOgate MultiStart algorithm for use with nonlinear programming for global optimization
Krityakierne, Tipaluck, (2017)
- More ...
-
Solving molecular distance geometry problems by global optimization algorithms
Grosso, Andrea, (2009)
-
A heuristic approach for the max-min diversity problem based on max-clique
Della Croce, Federico, (2009)
-
Simple ingredients leading to very efficient heuristics for the maximum clique problem
Grosso, Andrea, (2008)
- More ...