An exact algorithm for the Steiner tree problem with delays

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

dc.contributor.author	Leggieri, V.
dc.contributor.author	Haouari, Mohamed
dc.contributor.author	Triki, C.
dc.date.accessioned	2012-05-30T12:09:48Z
dc.date.available	2012-05-30T12:09:48Z
dc.date.issued	2010-08-01
dc.identifier.issn	1571-0653
dc.identifier.uri	http://hdl.handle.net/10679/183
dc.identifier.uri	http://www.sciencedirect.com/science/article/pii/S1571065310000302
dc.description.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.	en_US
dc.language.iso	eng	en_US
dc.publisher	Elsevier	en_US
dc.relation.ispartof	Electronic Notes in Discrete Mathematics
dc.rights	restrictedAccess
dc.title	An exact algorithm for the Steiner tree problem with delays	en_US
dc.type	Conference paper	en_US
dc.description.version	post-print
dc.peerreviewed	yes	en_US
dc.publicationstatus	published	en_US
dc.contributor.department	Özyeğin University
dc.contributor.authorID	(ORCID 0000-0003-0767-8220 & YÖK ID ) Haouari, Mohamed
dc.contributor.ozuauthor	Haouari, Mohamed
dc.identifier.volume	36
dc.identifier.startpage	223
dc.identifier.endpage	230
dc.identifier.doi	10.1016/j.endm.2010.05.029
dc.subject.keywords	Steiner tree problem	en_US
dc.subject.keywords	MTZ subtour elimination constraints	en_US
dc.subject.keywords	Branch-and-cut	en_US
dc.identifier.scopus	SCOPUS:2-s2.0-77954936857
dc.contributor.authorMale	1
dc.relation.publicationcategory	Conference Paper - International - Institutional Academic Staff