A constraint-based parallel local search for the edge-disjoint rooted distance-constrained minimum spanning tree problem.
Alejandro ArbelaezDeepak MehtaBarry O'SullivanLuis QuesadaPublished in: J. Heuristics (2018)
Keyphrases
- edge disjoint
- spanning tree
- total length
- satisfiability testing
- search space
- optimal solution
- hard constraints
- memetic algorithm
- distance measure
- distance function
- genetic algorithm
- parallel implementation
- parallel processing
- constraint satisfaction
- euclidean distance
- parallel computation
- tabu search
- distance metric
- shared memory
- graphical models
- simulated annealing
- massively parallel
- distributed memory
- scheduling problem
- np hard
- search algorithm