Friday, January 9, 2026 3:30 pm
-
4:30 pm
EST (GMT -05:00)
| Speaker: | Felipe Fidalgo |
| Affiliation: | Universidade Federal de Santa Catarina |
| Location: | MC 5501 |
Abstract: Discretizable Distance Geometry Problems (DDGP) consist in a subclass of Distance Geometry Problems (DGP) where the search space can be discretized and reduced to a binary tree. Such problems can be tackled by applying a Branch-and- Prune algorithm (BP), 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 splitting it into subtrees so that they can be explored only once, favouring and improvement on the algorithm performances.
We present some computational experiments on a set of artificially generated instances, with exact distances, to validate the theoretical results.
Joint work with Douglas S. Gonçalves (UFSC, Brazil), Carlile Lavor (UNICAMP, Brazil), Leo Liberti (CNRS, France) and Antonio Mucherino (Université de Rennes, France).