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 : an international journal. - Norvell, Mass. : Springer, ISSN 0926-6003, ZDB-ID 1157578-5. - Vol. 43.2009, 1, p. 23-37
|
| Subject: | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Nichtlineare Optimierung | Nonlinear programming |
-
Randomized decomposition solver with the quadratic assignment problem as a case study
Mihić, Krešimir, (2018)
-
An exact penalty function method for optimising QAP formulation in facility layout problem
Zhou, Jingyang, (2017)
-
A decomposition-based algorithm for the scheduling of open-pit networks over multiple time periods
Blom, Michelle L., (2016)
- More ...
-
Solving molecular distance geometry problems by global optimization algorithms
Grosso, Andrea, (2009)
-
Simple ingredients leading to very efficient heuristics for the maximum clique problem
Grosso, Andrea, (2008)
-
A heuristic approach for the max-min diversity problem based on max-clique
Della Croce, Federico, (2009)
- More ...