Title :
A metaheuristic solution to a constrained Steiner tree problem
Author :
Bravo-Azlan, Hugo ; Candia-Véjar, Alfredo
Author_Institution :
Dept. of Math., Univ. of Tarapaca, Arica, Chile
Abstract :
In this paper, an application of the simulated annealing algorithm to the Steiner problem in directed acyclic graphs (SPDAG) is presented. This approach is extended to a constrained SPDAG where a budget is imposed on the total amount of a resource required by the arcs in the solution
Keywords :
constraint theory; directed graphs; heuristic programming; simulated annealing; trees (mathematics); arc resource requirements; budget; constrained Steiner tree problem; directed acyclic graphs; metaheuristic solution; simulated annealing algorithm; Algorithm design and analysis; Cost function; Linear programming; Mathematics; Simulated annealing; Steiner trees; Testing;
Conference_Titel :
Computer Science Society, 1997. Proceedings., XVII International Conference of the Chilean
Conference_Location :
Valparaiso
Print_ISBN :
0-8186-8052-0
DOI :
10.1109/SCCC.1997.636851
