Branch-and-prune trees with bounded width

10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2011 - Proceedings of the Conference

Volumn , Issue , 2011, Pages 189-193

  Liberti, Leo ^a   Masson, Benoît ^b   Lavor, Carlile ^c   Mucherino, Antonio ^b  

^a ÉCOLE POLYTECHNIQUE   (France)

^b CAMPUS DE BEAULIEU   (France)

^c UNIVERSITY OF CAMPINAS   (Brazil)

Author keywords

Distance geometry; DMDGP; Order; Reflection; Symmetry

Indexed keywords

EID: 84855991185     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. L. Blumenthal. Theory and Applications of Distance Geometry. Oxford University Press, Oxford, 1953.
2. 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, pages 2673-2684, 2004.
3. C. Lavor, L. Liberti, and N. Maculan. The discretizable molecular distance geometry problem. Technical Report q-bio/0608012, arXiv, 2006.
4. C. Lavor, A. Mucherino, L. Liberti, and N. Maculan. On the computation of protein backbones by using artificial backbones of hydrogens. Journal of Global Optimization, accepted.
5. 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-17, 2008.
6. L. Liberti, C. Lavor, A. Mucherino, and N. Maculan. Molecular distance geometry methods: from continuous to discrete. International Transactions in Operational Research, 18:33-51, 2010.
7. L. Liberti, B. Masson, C. Lavor, J. Lee, and A. Mucherino. On the number of solutions of the discretizable molecular distance geometry problem. Technical Report 1010.1834v1 [cs.DM], arXiv, 2010.
8. A. Mucherino, C. Lavor, and L. Liberti. The discretizable distance geometry problem. Optimization Letters, in revision.
9. J.B. Saxe. Embeddability of weighted graphs in k-space is strongly NP-hard. Proceedings of 17th Allerton Conference in Communications, Control and Computing, pages 480-489, 1979.