A symmetry-based splitting strategy for discretizable distance geometry problems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Global Optimization Year : 2018

A symmetry-based splitting strategy for discretizable distance geometry problems

Abstract

Discretizable distance geometry problems consist in a subclass of distance geometry problems where the search space can be discretized and reduced to a tree. Such problems can be tackled by applying a branch-and-prune algorithm, which is able to perform an exhaustive enumeration of the solution set. In this work, we exploit the concept of symmetry in the search tree for isolating subtrees that are explored only one time for improving the algorithm performances. The proposed strategy is based on the idea of dividing an original instance of the problem into sub-instances that can thereafter be solved (almost) independently. We present some computational experiments on a set of artificially generated instances, with exact distances, to validate the theoretical results.
Fichier principal
Vignette du fichier
jogo18a.pdf (809.37 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02105087 , version 1 (20-04-2019)

Identifiers

Cite

Felipe Fidalgo, Douglas Gonçalves, Carlile Lavor, Leo Liberti, Antonio Mucherino. A symmetry-based splitting strategy for discretizable distance geometry problems. Journal of Global Optimization, 2018, 71 (4), pp.717-733. ⟨10.1007/s10898-018-0610-9⟩. ⟨hal-02105087⟩
474 View
132 Download

Altmetric

Share

Gmail Facebook X LinkedIn More