Login / Signup
A tabu search procedure based on a random Roulette diversification for the weighted maximal planar graph problem.
Ibrahim H. Osman
Published in:
Comput. Oper. Res. (2006)
Keyphrases
</>
search procedure
tabu search
planar graphs
simulated annealing
path relinking
metaheuristic
search algorithm
search space
scheduling problem
feasible solution
weighted graph
vehicle routing problem
search procedures
genetic algorithm
approximate inference
evolutionary algorithm
shortest path
pairwise
message passing