Please use this identifier to cite or link to this item:
Type: Artigo de periódico
Title: Discretization Vertex Orders In Distance Geometry
Author: Cassioli A.
Gunluk O.
Lavor C.
Liberti L.
Abstract: When a weighted graph is an instance of the Distance Geometry Problem (DGP), certain types of vertex orders (called discretization orders) allow the use of a very efficient, precise and robust discrete search algorithm (called Branch-and-Prune). Accordingly, finding such orders is critically important in order to solve DGPs in practice. We discuss three types of discretization orders, the complexity of determining their existence in a given graph, and the inclusion relations between the three order existence problems. We also give three mathematical programming formulations of some of these ordering problems.
Editor: Elsevier
Rights: fechado
Identifier DOI: 10.1016/j.dam.2014.08.035
Date Issue: 2015
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File Description SizeFormat 
2-s2.0-84923846086.pdf416.91 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.