Show simple item record

dc.contributor.authorLeggieri, V.
dc.contributor.authorHaouari, Mohamed
dc.contributor.authorTriki, C.
dc.date.accessioned2014-07-10T08:41:57Z
dc.date.available2014-07-10T08:41:57Z
dc.date.issued2012-12
dc.identifier.issn1862-4480
dc.identifier.urihttp://hdl.handle.net/10679/477
dc.identifier.urihttp://link.springer.com/article/10.1007%2Fs11590-011-0368-1
dc.descriptionDue to copyright restrictions, the access to the full text of this article is only available via subscription.
dc.description.abstractIn this paper, we investigate the Steiner tree problem with delays, which is a generalized version of the Steiner tree problem applied to multicast routing. For this challenging combinatorial optimization problem, we present an enhanced directed cut-based MIP formulation and an exact solution method based on a branch-and-cut approach. Our computational study reveals that the proposed approach can optimally solve hard dense instances.en_US
dc.language.isoengen_US
dc.publisherSpringer Science+Business Mediaen_US
dc.relation.ispartofOptimization Letters
dc.rightsrestrictedAccess
dc.titleA branch-and-cut algorithm for the Steiner tree problem with delaysen_US
dc.typeArticleen_US
dc.peerreviewedyesen_US
dc.publicationstatuspublisheden_US
dc.contributor.departmentÖzyeğin University
dc.contributor.ozuauthorHaouari, Mohamed
dc.identifier.volume6
dc.identifier.issue8
dc.identifier.startpage1753
dc.identifier.endpage1771
dc.identifier.wosWOS:000315348000014
dc.identifier.doi10.1007/s11590-011-0368-1
dc.subject.keywordsSteiner tree problemen_US
dc.subject.keywordsDelay constraintsen_US
dc.subject.keywordsBranch-and-cut methoden_US
dc.identifier.scopusSCOPUS:2-s2.0-84869492644
dc.contributor.authorMale1


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