Determining the Minimum Cost Steiner Tree for Delay Constrained Problems

We address a variant of the Steiner tree problem for delay constrained problems. The addressed problem consists in determining the minimum cost Steiner tree, while guaranteeing that the delay between any two terminal nodes does not exceed a given maximum value. This problem is known as the bounded d...

Full description

Bibliographic Details
Main Author: Martins, Lúcia (author)
Other Authors: Santos, Dorabella (author), Gomes, Teresa (author), Girão-Silva, Rita (author)
Format: article
Language:eng
Published: 2021
Subjects:
Delay-constrained
Graph reductions
Heuristic
Integer linear programming
Steiner tree problem
Online Access:http://hdl.handle.net/10316/96230
Country:Portugal
Oai:oai:estudogeral.sib.uc.pt:10316/96230

Internet

http://hdl.handle.net/10316/96230

Similar Items