In this paper, we investigate the Steiner Tree Problem with Delays (STPD), which is a generalized version of the Steiner tree problem applied to multicast rout- ing. For this challenging combinatorial optimization problem, we present an enhanced directed cut-based MIP formulation and an exact solution method based on a branch- and-cut approach. Our computational study reveals that the proposed approach can optimally solve hard dense instances.

A Branch-and-Cut Algorithm for the Steiner Tree Problem with Delays

TRIKI, CHEFI
2012-01-01

Abstract

In this paper, we investigate the Steiner Tree Problem with Delays (STPD), which is a generalized version of the Steiner tree problem applied to multicast rout- ing. For this challenging combinatorial optimization problem, we present an enhanced directed cut-based MIP formulation and an exact solution method based on a branch- and-cut approach. Our computational study reveals that the proposed approach can optimally solve hard dense instances.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11587/381126
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 3
  • ???jsp.display-item.citation.isi??? 2
social impact