Optimal partial discretization orders for discretizable distance geometry.
Saved in:
| Title: | Optimal partial discretization orders for discretizable distance geometry. |
|---|---|
| Authors: | Gonçalves, Douglas S.1 douglas.goncalves@ufsc.br, Mucherino, Antonio2 antonio.mucherino@irisa.fr |
| Source: | International Transactions in Operational Research. Sep2016, Vol. 23 Issue 5, p947-967. 21p. |
| Subjects: | Distance geometry, Mathematical optimization, Discretization methods, Geometric vertices, Linear orderings |
| Abstract: | The distance geometry problem (DGP) studies whether a simple weighted undirected graph [ABSTRACT FROM AUTHOR] |
| Copyright of International Transactions in Operational Research is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | The distance geometry problem (DGP) studies whether a simple weighted undirected graph [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 09696016 |
| DOI: | 10.1111/itor.12249 |
