-
1
-
-
55549138762
-
A distributed SDP approach for large-scale noisy anchor-free graph realization with applications to molecular conformation
-
P. Biswas, K.-C. Toh, and Y. Ye, A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation, SIAM Journal on Scientific Computing 30, 1251-1277, 2008.
-
(2008)
SIAM Journal on Scientific Computing
, vol.30
, pp. 1251-1277
-
-
Biswas, P.1
Toh, K.-C.2
Ye, Y.3
-
2
-
-
8344261381
-
-
T. Eren, D.K. Goldenberg, W. Whiteley, Y.R. Yang, A.S. Morse, B.D.O. Anderson and P.N. Belhumeur, Rigidity, Computation, and Randomization in Network Localization, IEEE Infocom Proceedings, 2673-2684, 2004.
-
(2004)
Rigidity, Computation, and Randomization in Network Localization, IEEE Infocom Proceedings
, pp. 2673-2684
-
-
Eren, T.1
Goldenberg, D.K.2
Whiteley, W.3
Yang, Y.R.4
Morse, A.S.5
Anderson, B.D.O.6
Belhumeur, P.N.7
-
3
-
-
33847302188
-
Distance geometry
-
D.M. Grant and R.K. Harris (Eds.) Wiley, New York
-
T.F. Havel, Distance Geometry, D.M. Grant and R.K. Harris (Eds.), Encyclopedia of Nuclear Magnetic Resonance, Wiley, New York, 1701-1710, 1995.
-
(1995)
Encyclopedia of Nuclear Magnetic Resonance
, pp. 1701-1710
-
-
Havel, T.F.1
-
4
-
-
78049476090
-
-
Tech. Rep. q-bio.BM/0608012, arXiv
-
C. Lavor, L. Liberti, and N. Maculan, Discretizable Molecular Distance Geometry Problem, Tech. Rep. q-bio.BM/0608012, arXiv, 2006.
-
(2006)
Discretizable Molecular Distance Geometry Problem
-
-
Lavor, C.1
Liberti, L.2
Maculan, N.3
-
5
-
-
85084371526
-
Recent results on the discretizable molecular distance geometry problem
-
Nancy, France, February 10-12
-
C. Lavor, L. Liberti, A. Mucherino, and N. Maculan, Recent Results on the Discretizable Molecular Distance Geometry Problem, Proceedings of the Conference ROADEF09, Nancy, France, February 10-12, 2009.
-
(2009)
Proceedings of the Conference ROADEF09
-
-
Lavor, C.1
Liberti, L.2
Mucherino, A.3
Maculan, N.4
-
6
-
-
72949109097
-
On a discretizable subclass of instances of the molecular distance geometry problem
-
Honolulu, Hawaii, March 8-12
-
C. Lavor, L. Liberti, A. Mucherino and N. Maculan, On a Discretizable Subclass of Instances of the Molecular Distance Geometry Problem, Proceedings of the Conference SAC09, Honolulu, Hawaii, March 8-12, 2009.
-
(2009)
Proceedings of the Conference SAC09
-
-
Lavor, C.1
Liberti, L.2
Mucherino, A.3
Maculan, N.4
-
7
-
-
68949155001
-
A branch- and-prune algorithm for the molecular distance geometry problem
-
L. Liberti, C. Lavor, and N. Maculan, A Branch- and-Prune Algorithm for the Molecular Distance Geometry Problem, International Transactions in Operational Research 15 (1), 1-17, 2008.
-
(2008)
International Transactions in Operational Research
, vol.15
, Issue.1
, pp. 1-17
-
-
Liberti, L.1
Lavor, C.2
Maculan, N.3
-
8
-
-
33847251002
-
An updated geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data
-
D. Wu and Z. Wu, An Updated Geometric Build-Up Algorithm for Solving the Molecular Distance Geometry Problem with Sparse Distance Data, Journal of Global Optimization 37, 661-673, 2007.
-
(2007)
Journal of Global Optimization
, vol.37
, pp. 661-673
-
-
Wu, D.1
Wu, Z.2
|