A branch-and-cut algorithm for the Steiner tree problem with delays

Name: A branch-and-cut algorithm for the Steiner tree problem with delays
Author: Leggieri, V., Haouari, Mohamed, Triki, C.

İsim	A branch-and-cut algorithm for the Steiner tree problem with delays
Yazar	Leggieri, V., Haouari, Mohamed, Triki, C.
Basım Tarihi:	2012-12
Basım Yeri	- Springer Science+Business Media
Konu	Steiner tree problem, Delay constraints, Branch-and-cut method
Tür	Süreli Yayın
Dil	İngilizce
Dijital	Evet
Yazma	Hayır
Kütüphane:	Özyeğin Üniversitesi
Demirbaş Numarası	1862-4480
Kayıt Numarası	dd673f99-8ff1-4bab-a0d4-0a4c341a640e
Lokasyon	Industrial Engineering
Tarih	2012-12
Notlar	Due to copyright restrictions, the access to the full text of this article is only available via subscription.
Örnek Metin	In this paper, we investigate the Steiner tree problem with delays, which is a generalized version of the Steiner tree problem applied to multicast routing. 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.
DOI	10.1007/s11590-011-0368-1
Cilt	6

Kaynağa git Özyeğin Üniversitesi

Aramaya Dön

Özyeğin Üniversitesi

Kaynağa git

A branch-and-cut algorithm for the Steiner tree problem with delays

Yazar Leggieri, V., Haouari, Mohamed, Triki, C.

Basım Tarihi 2012-12

Basım Yeri - Springer Science+Business Media

Konu Steiner tree problem, Delay constraints, Branch-and-cut method

Tür Süreli Yayın

Dil İngilizce

Dijital Evet

Yazma Hayır

Kütüphane Özyeğin Üniversitesi

Demirbaş Numarası 1862-4480

Kayıt Numarası dd673f99-8ff1-4bab-a0d4-0a4c341a640e

Lokasyon Industrial Engineering

Tarih 2012-12

Notlar Due to copyright restrictions, the access to the full text of this article is only available via subscription.

Örnek Metin In this paper, we investigate the Steiner tree problem with delays, which is a generalized version of the Steiner tree problem applied to multicast routing. 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.

DOI 10.1007/s11590-011-0368-1

Cilt 6