G-DMP: An algorithm without constraint relaxation to solve the train departure matching problem.

Alondra Rojas Elizabeth Montero María Cristina Riff

Published in: CEC (2017)

Keyphrases

matching algorithm
learning algorithm
optimal solution
np hard
dynamic programming
detection algorithm
computational complexity
memory efficient
k means
image matching
constraint relaxation
string matching
convex hull
worst case
upper bound
probabilistic model
special case
search space
lower bound
search algorithm