Show simple item record

dc.contributor.authorAkgün, I.en_US
dc.contributor.authorTansel, B. Ç.en_US
dc.date.accessioned2016-02-08T09:52:04Z
dc.date.available2016-02-08T09:52:04Z
dc.date.issued2011en_US
dc.identifier.issn0377-2217
dc.identifier.urihttp://hdl.handle.net/11693/21856
dc.description.abstractGiven an undirected network with positive edge costs and a natural number p, the Hop-Constrained Minimum Spanning Tree problem (HMST) is the problem of finding a spanning tree with minimum total cost such that each path starting from a specified root node has no more than p hops (edges). In this paper, we develop new formulations for HMST. The formulations are based on Miller-Tucker-Zemlin (MTZ) subtour elimination constraints, MTZ-based liftings in the literature offered for HMST, and a new set of topology-enforcing constraints. We also compare the proposed models with the MTZ-based models in the literature with respect to linear programming relaxation bounds and solution times. The results indicate that the new models give considerably better bounds and solution times than their counterparts in the literature and that the new set of constraints is competitive with liftings to MTZ constraints, some of which are based on well-known, strong liftings of Desrochers and Laporte (1991).en_US
dc.language.isoEnglishen_US
dc.source.titleEuropean Journal of Operational Researchen_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/j.ejor.2011.01.051en_US
dc.subjectGraph theoryen_US
dc.subjectInteger programmingen_US
dc.subjectSpanning treesen_US
dc.subjectHop constraintsen_US
dc.subjectMiller–Tucker–Zemlin constraintsen_US
dc.titleNew formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraintsen_US
dc.typeArticleen_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.citation.spage263en_US
dc.citation.epage276en_US
dc.citation.volumeNumber212en_US
dc.citation.issueNumber2en_US
dc.identifier.doi10.1016/j.ejor.2011.01.051en_US
dc.publisherElsevieren_US
dc.identifier.eissn1872-6860


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record