An iterative linear relaxation and tabu search approach to minimum initial marking problems of timed marked graphs.
Morikazu NakamuraM. SilvaPublished in: ECC (1999)
Keyphrases
- tabu search
- simulated annealing
- heuristic methods
- linear relaxation
- metaheuristic
- genetic algorithm
- search heuristics
- minimum cost
- scheduling problem
- vehicle routing problem
- feasible solution
- search algorithm
- memetic algorithm
- benchmark problems
- spanning tree
- graph theoretic
- random graphs
- optimization problems
- tabu search algorithm
- relaxation algorithm
- search procedure
- linear programming
- constant factor
- np hard