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.
|
|
| FullText | Links: – Type: pdflink Text: Availability: 1 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 115403933 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Optimal partial discretization orders for discretizable distance geometry. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Gonçalves%2C+Douglas+S%2E%22">Gonçalves, Douglas S.</searchLink><relatesTo>1</relatesTo><i> douglas.goncalves@ufsc.br</i><br /><searchLink fieldCode="AR" term="%22Mucherino%2C+Antonio%22">Mucherino, Antonio</searchLink><relatesTo>2</relatesTo><i> antonio.mucherino@irisa.fr</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22International+Transactions+in+Operational+Research%22">International Transactions in Operational Research</searchLink>. Sep2016, Vol. 23 Issue 5, p947-967. 21p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Distance+geometry%22">Distance geometry</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematical+optimization%22">Mathematical optimization</searchLink><br /><searchLink fieldCode="DE" term="%22Discretization+methods%22">Discretization methods</searchLink><br /><searchLink fieldCode="DE" term="%22Geometric+vertices%22">Geometric vertices</searchLink><br /><searchLink fieldCode="DE" term="%22Linear+orderings%22">Linear orderings</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: The distance geometry problem (DGP) studies whether a simple weighted undirected graph [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>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.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=115403933 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1111/itor.12249 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 21 StartPage: 947 Subjects: – SubjectFull: Distance geometry Type: general – SubjectFull: Mathematical optimization Type: general – SubjectFull: Discretization methods Type: general – SubjectFull: Geometric vertices Type: general – SubjectFull: Linear orderings Type: general Titles: – TitleFull: Optimal partial discretization orders for discretizable distance geometry. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Gonçalves, Douglas S. – PersonEntity: Name: NameFull: Mucherino, Antonio IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 09 Text: Sep2016 Type: published Y: 2016 Identifiers: – Type: issn-print Value: 09696016 Numbering: – Type: volume Value: 23 – Type: issue Value: 5 Titles: – TitleFull: International Transactions in Operational Research Type: main |
| ResultId | 1 |