Minimum cost ? k edges connected subgraph problems
| dc.contributor.author | Sharifov, Firdovsi | |
| dc.contributor.author | Kutucu, Hakan | |
| dc.coverage.doi | 10.1016/j.endm.2010.05.004 | |
| dc.date.accessioned | 2016-12-27T13:18:39Z | |
| dc.date.available | 2016-12-27T13:18:39Z | |
| dc.date.issued | 2010 | |
| dc.description.abstract | The 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.identifier.citation | Sharifov, 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.004 | en_US |
| dc.identifier.doi | 10.1016/j.endm.2010.05.004 | |
| dc.identifier.doi | 10.1016/j.endm.2010.05.004 | en_US |
| dc.identifier.issn | 1571-0653 | |
| dc.identifier.scopus | 2-s2.0-77954889760 | |
| dc.identifier.uri | http://doi.org/10.1016/j.endm.2010.05.004 | |
| dc.identifier.uri | https://hdl.handle.net/11147/2687 | |
| dc.language.iso | en | en_US |
| dc.publisher | Elsevier Ltd. | en_US |
| dc.relation.ispartof | Electronic Notes in Discrete Mathematics | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | en_US |
| dc.subject | Network models | en_US |
| dc.subject | Isomorphic graph | en_US |
| dc.subject | Matching | en_US |
| dc.title | Minimum cost ? k edges connected subgraph problems | en_US |
| dc.type | Article | en_US |
| dspace.entity.type | Publication | |
| gdc.author.institutional | Kutucu, Hakan | |
| gdc.author.yokid | 54685 | |
| gdc.bip.impulseclass | C5 | |
| gdc.bip.influenceclass | C5 | |
| gdc.bip.popularityclass | C5 | |
| gdc.coar.access | open access | |
| gdc.coar.type | text::journal::journal article | |
| gdc.collaboration.industrial | false | |
| gdc.description.department | İzmir Institute of Technology. Mathematics | en_US |
| gdc.description.endpage | 32 | en_US |
| gdc.description.issue | C | en_US |
| gdc.description.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
| gdc.description.scopusquality | N/A | |
| gdc.description.startpage | 25 | en_US |
| gdc.description.volume | 36 | en_US |
| gdc.description.wosquality | N/A | |
| gdc.identifier.openalex | W2041232017 | |
| gdc.index.type | Scopus | |
| gdc.oaire.accesstype | GOLD | |
| gdc.oaire.diamondjournal | false | |
| gdc.oaire.impulse | 1.0 | |
| gdc.oaire.influence | 2.855049E-9 | |
| gdc.oaire.isgreen | true | |
| gdc.oaire.keywords | Network models | |
| gdc.oaire.keywords | Isomorphic graph | |
| gdc.oaire.keywords | Matching | |
| gdc.oaire.popularity | 5.254983E-10 | |
| gdc.oaire.publicfunded | false | |
| gdc.oaire.sciencefields | 0211 other engineering and technologies | |
| gdc.oaire.sciencefields | 0102 computer and information sciences | |
| gdc.oaire.sciencefields | 02 engineering and technology | |
| gdc.oaire.sciencefields | 01 natural sciences | |
| gdc.openalex.collaboration | International | |
| gdc.openalex.fwci | 0.3470731 | |
| gdc.openalex.normalizedpercentile | 0.61 | |
| gdc.opencitations.count | 1 | |
| gdc.plumx.crossrefcites | 1 | |
| gdc.plumx.mendeley | 3 | |
| gdc.plumx.scopuscites | 1 | |
| gdc.scopus.citedcount | 1 | |
| relation.isAuthorOfPublication.latestForDiscovery | ed65b93e-dc95-40b7-b53e-9cf5ced48d04 | |
| relation.isOrgUnitOfPublication.latestForDiscovery | 9af2b05f-28ac-4012-8abe-a4dfe192da5e |