A Lagrangian relaxation approach for the multiple sequence alignment problem
Year of publication: |
2008
|
---|---|
Authors: | Althaus, Ernst ; Canzar, Stefan |
Published in: |
Journal of combinatorial optimization. - Norwell, Mass. : Springer Science + Business Media, ISSN 1382-6905, ZDB-ID 1339574-9. - Vol. 16.2008, 2, p. 127-154
|
Subject: | Biowissenschaften | Life sciences | Mathematische Optimierung | Mathematical programming | Branch-and-Bound | Branch and Bound | Theorie | Theory |
-
Ozturk, Onur, (2017)
-
Bin packing problem with time lags
Rivera Letelier, Orlando, (2022)
-
Li, Xiaolong, (2023)
- More ...
-
Approximating k-hop minimum-spanning trees
Althaus, Ernst, (2005)
-
Das Recht der Gemeinden und Gemeindeverbände
Althaus, Ernst, (1951)
-
Certifying feasibility and objective value of linear programs
Althaus, Ernst, (2012)
- More ...