A Branch-and-Prune algorithm for the Molecular Distance Geometry Problem-Reference-Cited by-同舟云学术

A Branch-and-Prune algorithm for the Molecular Distance Geometry Problem

Published:2008-01-02 Issue:1 Volume:15 Page:1-17
ISSN:0969-6016
Container-title:International Transactions in Operational Research
language:en
Short-container-title:

Author:

Liberti Leo,Lavor Carlile,Maculan Nelson

Publisher

Wiley

Subject

Management of Technology and Innovation,Management Science and Operations Research,Strategy and Management,Computer Science Applications,Business and International Management

Link

http://onlinelibrary.wiley.com/wol1/doi/10.1111/j.1475-3995.2007.00622.x/fullpdf

Reference16 articles.

1. A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances;Dong;Journal of Global Optimization,2002

2. Eren , T. Goldenberg , D.K. Whiteley , W. Yang , Y.R. Morse , A.S. Anderson , B.D.O. Belhumeur , P.N. 2004 IEEE InfoCom 2004 Proceedings

Cited by 101 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An impossible combinatorial counting method in distance geometry;Discrete Applied Mathematics;2024-09

2. A Branch-and-Bound Algorithm for the Molecular Ordered Covering Problem;Journal of Computational Biology;2024-06-01

3. A numerical-and-computational study on the impact of using quaternions in the branch-and-prune algorithm for exact discretizable distance geometry problems;Computational Optimization and Applications;2023-09-25

4. Systematic reviews as a metaknowledge tool: caveats and a review of available options;International Transactions in Operational Research;2023-05-09

5. The Ordered Covering Problem in Distance Geometry;Bioinformatics Research and Applications;2023