Author
Leggieri, V., Haouari, Mohamed, Triki, C.
Publication Date
2010-08-01
Publication Place
-
Elsevier
Subject
Steiner tree problem, MTZ subtour elimination constraints, Branch-and-cut
Type
Document
Language
English
Digital
Yes
Manuscript
No
Library
Özyeğin University
Library Asset ID
1571-0653
Record ID
26e53b27-5966-419f-9086-b7f4fc677196
Library Location
Industrial Engineering
Date
2010-08-01
Sample Text
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
