An exact algorithm for the Steiner tree problem with delays

Name: An exact algorithm for the Steiner tree problem with delays
Author: Leggieri, V., Haouari, Mohamed, Triki, C.

İsim	An exact algorithm for the Steiner tree problem with delays
Yazar	Leggieri, V., Haouari, Mohamed, Triki, C.
Basım Tarihi:	2010-08-01
Basım Yeri	- Elsevier
Konu	Steiner tree problem, MTZ subtour elimination constraints, Branch-and-cut
Tür	Belge
Dil	İngilizce
Dijital	Evet
Yazma	Hayır
Kütüphane:	Özyeğin Üniversitesi
Demirbaş Numarası	1571-0653
Kayıt Numarası	26e53b27-5966-419f-9086-b7f4fc677196
Lokasyon	Industrial Engineering
Tarih	2010-08-01
Örnek Metin	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.
DOI	10.1016/j.endm.2010.05.029
Cilt	36

Kaynağa git Özyeğin Üniversitesi

Aramaya Dön

Özyeğin Üniversitesi

Kaynağa git

An exact algorithm for the Steiner tree problem with delays

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

Basım Tarihi 2010-08-01

Basım Yeri - Elsevier

Konu Steiner tree problem, MTZ subtour elimination constraints, Branch-and-cut

Tür Belge

Dil İngilizce

Dijital Evet

Yazma Hayır

Kütüphane Özyeğin Üniversitesi

Demirbaş Numarası 1571-0653

Kayıt Numarası 26e53b27-5966-419f-9086-b7f4fc677196

Lokasyon Industrial Engineering

Tarih 2010-08-01

Örnek Metin 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.

DOI 10.1016/j.endm.2010.05.029

Cilt 36