Feasibility check for the distance geometry problem: an application to molecular conformations

The distance geometry problem (DGP) consists in finding an embedding in a metric space of a given weighted undirected graph such that for each edge in the graph, the corresponding distance in the embedding belongs to a given distance interval. We discuss the relationship between the existence of a g...

Full description

Bibliographic Details
Main Author: Agra, Agostinho (author)
Other Authors: Figueiredo, Rosa (author), Lavor, Carlile (author), Maculan, Nelson (author), Pereira, António (author), Requejo, Cristina (author)
Format: article
Language:eng
Published: 2017
Subjects:
Distance geometry problem
Graph embedding
Integer programming
Constraint programming
Online Access:http://hdl.handle.net/10773/18405
Country:Portugal
Oai:oai:ria.ua.pt:10773/18405

Internet

http://hdl.handle.net/10773/18405

Similar Items