An Efficient Exhaustive Search for the Discretizable Distance Geometry Problem with Interval Data

Antonio Mucherino, Jung-Hsin Lin. An Efficient Exhaustive Search for the Discretizable Distance Geometry Problem with Interval Data. In Maria Ganzha, Leszek A. Maciaszek, Marcin Paprzycki, editors, Proceedings of the 2019 Federated Conference on Computer Science and Information Systems, FedCSIS 2019, Leipzig, Germany, September 1-4, 2019. pages 135-141, 2019. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.