An Efficient Exhaustive Search for the Discretizable Distance Geometry Problem with Interval Data.

Antonio Mucherino Jung-Hsin Lin

Published in: FedCSIS (2019)

Keyphrases

exhaustive search
interval data
minmax regret
shortest path problem
dynamic programming
computational complexity
search space
search methods
solution space
temporal data
data clustering
lower bound
special case
optimal solution
shortest path
simulated annealing
mathematical model
multivariate data
neural network