Author of the publication

MD-jeep: a New Release for Discretizable Distance Geometry Problems with Interval Data.

, , , , , and . FedCSIS, volume 21 of Annals of Computer Science and Information Systems, page 289-294. (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Optimal partial discretization orders for discretizable distance geometry., and . ITOR, 23 (5): 947-967 (2016)A New Algorithm for the KDMDGP Subclass of Distance Geometry Problems with Exact Distances., , , and . Algorithmica, 83 (8): 2400-2426 (2021)Solving the One-dimensional Distance Geometry Problem by Optical Computing., , , , and . CoRR, (2021)Nonmonotone inexact restoration approach for minimization with orthogonality constraints., , , and . Numer. Algorithms, 86 (4): 1651-1684 (2021)Local Convergence Analysis of the Levenberg-Marquardt Framework for Nonzero-Residue Nonlinear Least-Squares Problems Under an Error Bound Condition., , and . J. Optim. Theory Appl., 183 (3): 1099-1122 (2019)Discretization orders and efficient computation of cartesian coordinates for distance geometry., and . Optim. Lett., 8 (7): 2111-2125 (2014)Assigned and unassigned distance geometry: applications to biological molecules and nanostructures., , , , and . 4OR, 14 (4): 337-376 (2016)An adaptive branching scheme for the Branch & Prune algorithm applied to Distance Geometry., , and . FedCSIS, volume 2 of Annals of Computer Science and Information Systems, page 457-463. (2014)An Approach to Dynamical Distance Geometry., and . GSI, volume 10589 of Lecture Notes in Computer Science, page 821-829. Springer, (2017)Mathematical methods in quantum state tomography.. University of Campinas, Brazil, (2013)ndltd.org (oai:agregador.ibict.br.RI_UNICAMP:oai:repositorio.unicamp.br:REPOSIP/305944).