Discretization Vertex Orders In Distance Geometry

dc.creatorCassioli A.
dc.creatorGunluk O.
dc.creatorLavor C.
dc.creatorLiberti L.
dc.date2015
dc.date2015-06-25T12:54:14Z
dc.date2015-11-26T15:15:45Z
dc.date2015-06-25T12:54:14Z
dc.date2015-11-26T15:15:45Z
dc.date.accessioned2018-03-28T22:25:34Z
dc.date.available2018-03-28T22:25:34Z
dc.identifier
dc.identifierDiscrete Applied Mathematics. Elsevier, v. , n. , p. - , 2015.
dc.identifier0166218X
dc.identifier10.1016/j.dam.2014.08.035
dc.identifierhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84923846086&partnerID=40&md5=8d1d86298df6bd92cd8bc85f494e88c6
dc.identifierhttp://www.repositorio.unicamp.br/handle/REPOSIP/85572
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/85572
dc.identifier2-s2.0-84923846086
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1259087
dc.descriptionWhen 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.
dc.description
dc.description
dc.description
dc.description
dc.languageen
dc.publisherElsevier
dc.relationDiscrete Applied Mathematics
dc.rightsfechado
dc.sourceScopus
dc.titleDiscretization Vertex Orders In Distance Geometry
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución