Please use this identifier to cite or link to this item: https://hdl.handle.net/11147/2687
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSharifov, Firdovsi-
dc.contributor.authorKutucu, Hakan-
dc.date.accessioned2016-12-27T13:18:39Z-
dc.date.available2016-12-27T13:18:39Z-
dc.date.issued2010-08-
dc.identifier.citationSharifov, F., and Kutucu, H. (2010). Minimum cost ≤ k edges connected subgraph problems. Electronic Notes in Discrete Mathematics, 36(C), 25-32. doi:10.1016/j.endm.2010.05.004en_US
dc.identifier.issn1571-0653-
dc.identifier.urihttp://doi.org/10.1016/j.endm.2010.05.004-
dc.identifier.urihttp://hdl.handle.net/11147/2687-
dc.description.abstractThe minimum-cost network design problem is considered in the case where an optimum network remains connected, after deleting any ≤ k edges which form a matching in the optimum network. For the case k=1, we develop heuristic algorithms to compute a lower and an upper bounds for optimal value of objective function. These algorithms are used in the branch and bound methods to find a solution to the considered problem. We also present computational results. © 2010 Elsevier B.V.en_US
dc.language.isoenen_US
dc.publisherElsevier Ltd.en_US
dc.relation.ispartofElectronic Notes in Discrete Mathematicsen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectNetwork modelsen_US
dc.subjectIsomorphic graphen_US
dc.subjectMatchingen_US
dc.titleMinimum cost ? k edges connected subgraph problemsen_US
dc.typeArticleen_US
dc.authoridTR54685en_US
dc.institutionauthorKutucu, Hakan-
dc.departmentİzmir Institute of Technology. Mathematicsen_US
dc.identifier.volume36en_US
dc.identifier.issueCen_US
dc.identifier.startpage25en_US
dc.identifier.endpage32en_US
dc.identifier.scopus2-s2.0-77954889760en_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.identifier.doi10.1016/j.endm.2010.05.004-
dc.relation.doi10.1016/j.endm.2010.05.004en_US
dc.coverage.doi10.1016/j.endm.2010.05.004en_US
dc.identifier.scopusqualityQ3-
item.grantfulltextopen-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
item.openairetypeArticle-
item.languageiso639-1en-
item.fulltextWith Fulltext-
crisitem.author.dept04.02. Department of Mathematics-
Appears in Collections:Mathematics / Matematik
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
Files in This Item:
File Description SizeFormat 
2687.pdfMakale226.3 kBAdobe PDFThumbnail
View/Open
Show simple item record



CORE Recommender

SCOPUSTM   
Citations

1
checked on Mar 29, 2024

Page view(s)

84
checked on Apr 22, 2024

Download(s)

196
checked on Apr 22, 2024

Google ScholarTM

Check




Altmetric


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.