• DocumentCode
    2402661
  • 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
  • fYear
    1997
  • fDate
    10-15 Nov 1997
  • Firstpage
    16
  • Lastpage
    20
  • 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;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Science Society, 1997. Proceedings., XVII International Conference of the Chilean
  • Conference_Location
    Valparaiso
  • Print_ISBN
    0-8186-8052-0
  • Type

    conf

  • DOI
    10.1109/SCCC.1997.636851
  • Filename
    636851
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2402661