The interval Branch & Prune Algorithm for the Discretizable Molecular Distance Geometry Problem with Inexact Distances - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Global Optimization Year : 2013

The interval Branch & Prune Algorithm for the Discretizable Molecular Distance Geometry Problem with Inexact Distances

Antonio Mucherino  : Connect in order to contact the contributor

https://inria.hal.science/hal-00912660

Submitted on : Monday, December 2, 2013-2:46:05 PM

Last modification on : Friday, March 24, 2023-2:52:57 PM

No file

Dates and versions

hal-00912660 , version 1 (02-12-2013)

Identifiers

  • HAL Id : hal-00912660 , version 1

Cite

Carlile Lavor, Leo Liberti, Antonio Mucherino. The interval Branch & Prune Algorithm for the Discretizable Molecular Distance Geometry Problem with Inexact Distances. Journal of Global Optimization, 2013, 56 (3), pp.855-871. ⟨hal-00912660⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

X INSTITUT-TELECOM EC-PARIS UNIV-RENNES1 CNRS INRIA INSA-RENNES IRISA IRISA-D7 INRIA2 UR1-MATH-STIC UR1-UFR-ISTIC UNIV-RENNES UR1-MATH-NUM
151 View
0 Download

Share

Gmail Facebook X LinkedIn More