Show simple item record

dc.contributor.authorLeggieri, V.
dc.contributor.authorHaouari, Mohamed
dc.contributor.authorTriki, C.
dc.date.accessioned2012-05-30T12:09:48Z
dc.date.available2012-05-30T12:09:48Z
dc.date.issued2010-08-01
dc.identifier.issn1571-0653
dc.identifier.urihttp://hdl.handle.net/10679/183
dc.identifier.urihttp://www.sciencedirect.com/science/article/pii/S1571065310000302
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.language.isoengen_US
dc.publisherElsevieren_US
dc.relation.ispartofElectronic Notes in Discrete Mathematics
dc.rightsrestrictedAccess
dc.titleAn exact algorithm for the Steiner tree problem with delaysen_US
dc.typeConference paperen_US
dc.description.versionpost-print
dc.peerreviewedyesen_US
dc.publicationstatuspublisheden_US
dc.contributor.departmentÖzyeğin University
dc.contributor.authorID(ORCID 0000-0003-0767-8220 & YÖK ID ) Haouari, Mohamed
dc.contributor.ozuauthorHaouari, Mohamed
dc.identifier.volume36
dc.identifier.startpage223
dc.identifier.endpage230
dc.identifier.doi10.1016/j.endm.2010.05.029
dc.subject.keywordsSteiner tree problemen_US
dc.subject.keywordsMTZ subtour elimination constraintsen_US
dc.subject.keywordsBranch-and-cuten_US
dc.identifier.scopusSCOPUS:2-s2.0-77954936857
dc.contributor.authorMale1
dc.relation.publicationcategoryConference Paper - International - Institutional Academic Staff


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record


Share this page