A NETWORK DESIGN PROBLEM WITH TWO-EDGE MATCHING FAILURES

Basit Öğe Kaydı
dc.contributor.authorSharifov, Firdovsi
dc.contributor.authorKutucu, Hakan
dc.date.accessioned2024-09-29T16:01:09Z
dc.date.available2024-09-29T16:01:09Z
dc.date.issued2015
dc.departmentKarabük Üniversitesien_US
dc.description.abstractIn this paper, we introduce a network design problem with two-edge matching failures. Given a graph, any two edges non-incident to the same node form a two-edge matching. The problem consists in finding a minimum-cost subgraph such that, when deleting any two-edge matching of the graph, every pair of terminal nodes remains connected. We give mixed integer linear programming formulations for the problem and propose a heuristic algorithm based on the Branch-and-Bound method to solve it. We also present computational results.en_US
dc.identifier.doi10.1051/ro/2014038
dc.identifier.endpage312en_US
dc.identifier.issn0399-0559
dc.identifier.issn1290-3868
dc.identifier.issue2en_US
dc.identifier.scopus2-s2.0-84921324477en_US
dc.identifier.scopusqualityQ3en_US
dc.identifier.startpage297en_US
dc.identifier.urihttps://doi.org/10.1051/ro/2014038
dc.identifier.urihttps://hdl.handle.net/20.500.14619/5542
dc.identifier.volume49en_US
dc.identifier.wosWOS:000348134500005en_US
dc.identifier.wosqualityQ4en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherEdp Sciences S Aen_US
dc.relation.ispartofRairo-Operations Researchen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectNetwork design problemen_US
dc.subjectlinear programmingen_US
dc.subjectBranch-and-Bound methoden_US
dc.subjectmatchingen_US
dc.titleA NETWORK DESIGN PROBLEM WITH TWO-EDGE MATCHING FAILURESen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu