An exact algorithm for the Steiner Tree Problem with Delays

Valeria Leggieri, Mohamed Haouari, Chefi Triki

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

The Steiner Tree Problem with Delays (STPD) is a variant of the well-known Steiner Tree Problem in which the delay on each path between a source node and a terminal node is limited by a given maximum value. We propose a Branch-and-Cut algorithm for solving this problem using a formulation based on lifted Miller-Tucker-Zemlin subtour elimination constraints. The effectiveness of the proposed algorithm is assessed through computational experiments carried out on dense benchmark instances.

Original languageEnglish
Pages (from-to)223-230
Number of pages8
JournalElectronic Notes in Discrete Mathematics
Volume36
Issue numberC
DOIs
Publication statusPublished - Aug 2010

Fingerprint

Steiner Tree Problem
Exact Algorithms
Branch-and-cut
Vertex of a graph
Computational Experiments
Elimination
Benchmark
Path
Formulation
Experiments

Keywords

  • Branch-and-Cut
  • MTZ subtour elimination constraints
  • Steiner Tree Problem

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Cite this

An exact algorithm for the Steiner Tree Problem with Delays. / Leggieri, Valeria; Haouari, Mohamed; Triki, Chefi.

In: Electronic Notes in Discrete Mathematics, Vol. 36, No. C, 08.2010, p. 223-230.

Research output: Contribution to journalArticle

Leggieri, Valeria ; Haouari, Mohamed ; Triki, Chefi. / An exact algorithm for the Steiner Tree Problem with Delays. In: Electronic Notes in Discrete Mathematics. 2010 ; Vol. 36, No. C. pp. 223-230.
@article{13feacd2e4e14d5395f11b49da7c7713,
title = "An exact algorithm for the Steiner Tree Problem with Delays",
abstract = "The Steiner Tree Problem with Delays (STPD) is a variant of the well-known Steiner Tree Problem in which the delay on each path between a source node and a terminal node is limited by a given maximum value. We propose a Branch-and-Cut algorithm for solving this problem using a formulation based on lifted Miller-Tucker-Zemlin subtour elimination constraints. The effectiveness of the proposed algorithm is assessed through computational experiments carried out on dense benchmark instances.",
keywords = "Branch-and-Cut, MTZ subtour elimination constraints, Steiner Tree Problem",
author = "Valeria Leggieri and Mohamed Haouari and Chefi Triki",
year = "2010",
month = "8",
doi = "10.1016/j.endm.2010.05.029",
language = "English",
volume = "36",
pages = "223--230",
journal = "Electronic Notes in Discrete Mathematics",
issn = "1571-0653",
publisher = "Elsevier",
number = "C",

}

TY - JOUR

T1 - An exact algorithm for the Steiner Tree Problem with Delays

AU - Leggieri, Valeria

AU - Haouari, Mohamed

AU - Triki, Chefi

PY - 2010/8

Y1 - 2010/8

N2 - The Steiner Tree Problem with Delays (STPD) is a variant of the well-known Steiner Tree Problem in which the delay on each path between a source node and a terminal node is limited by a given maximum value. We propose a Branch-and-Cut algorithm for solving this problem using a formulation based on lifted Miller-Tucker-Zemlin subtour elimination constraints. The effectiveness of the proposed algorithm is assessed through computational experiments carried out on dense benchmark instances.

AB - The Steiner Tree Problem with Delays (STPD) is a variant of the well-known Steiner Tree Problem in which the delay on each path between a source node and a terminal node is limited by a given maximum value. We propose a Branch-and-Cut algorithm for solving this problem using a formulation based on lifted Miller-Tucker-Zemlin subtour elimination constraints. The effectiveness of the proposed algorithm is assessed through computational experiments carried out on dense benchmark instances.

KW - Branch-and-Cut

KW - MTZ subtour elimination constraints

KW - Steiner Tree Problem

UR - http://www.scopus.com/inward/record.url?scp=77954936857&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77954936857&partnerID=8YFLogxK

U2 - 10.1016/j.endm.2010.05.029

DO - 10.1016/j.endm.2010.05.029

M3 - Article

VL - 36

SP - 223

EP - 230

JO - Electronic Notes in Discrete Mathematics

JF - Electronic Notes in Discrete Mathematics

SN - 1571-0653

IS - C

ER -