Publication:
An exact algorithm for the Steiner tree problem with delays

Simple item page
dc.contributor.authorLeggieri, V.
dc.contributor.authorHaouari, Mohamed
dc.contributor.authorTriki, C.
dc.contributor.departmentIndustrial Engineering
dc.contributor.ozuauthorHAOUARI, Mohamed
dc.date.accessioned2012-05-30T12:09:48Z
dc.date.available2012-05-30T12:09:48Z
dc.date.issued2010-08-01
dc.description.abstractThe 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.description.versionpost-print
dc.identifier.doi10.1016/j.endm.2010.05.029
dc.identifier.endpage230
dc.identifier.issn1571-0653
dc.identifier.scopus2-s2.0-77954936857
dc.identifier.startpage223
dc.identifier.urihttp://hdl.handle.net/10679/183
dc.identifier.urihttps://doi.org/10.1016/j.endm.2010.05.029
dc.identifier.volume36
dc.language.isoengen_US
dc.peerreviewedyesen_US
dc.publicationstatuspublisheden_US
dc.publisherElsevieren_US
dc.relation.ispartofElectronic Notes in Discrete Mathematics
dc.relation.publicationcategoryInternational
dc.rightsrestrictedAccess
dc.subject.keywordsSteiner tree problemen_US
dc.subject.keywordsMTZ subtour elimination constraintsen_US
dc.subject.keywordsBranch-and-cuten_US
dc.titleAn exact algorithm for the Steiner tree problem with delaysen_US
dc.typeconferenceObjecten_US
dspace.entity.typePublication
relation.isOrgUnitOfPublication5dd73c02-fd2d-43e0-9a23-71bab9ae0b6b
relation.isOrgUnitOfPublication.latestForDiscovery5dd73c02-fd2d-43e0-9a23-71bab9ae0b6b

Files

Collections

Industrial Engineering