Network design problem with cut constraints
| dc.contributor.author | Sharifov, F. | |
| dc.contributor.author | Kutucu, H. | |
| dc.date.accessioned | 2024-09-29T16:21:15Z | |
| dc.date.available | 2024-09-29T16:21:15Z | |
| dc.date.issued | 2018 | |
| dc.department | Karabük Üniversitesi | en_US |
| dc.description.abstract | In this paper, we introduce a minimum cost network design problem with a given lower bound requirement for capacity of any cut. First, we consider the subproblem including the lower bound requirement only for each fundamental cut determined by deleting edges from some spanning tree. Then, it is shown that the simplex algorithm finds an optimal solution to standard LP-relaxation of the subproblem in the linear time of the number of edges. The simplex and minimum cut algorithms are used in a Branch-and-Cut type algorithm to pick up a solution to the minimum cost network design problem. © Springer International Publishing AG, part of Springer Nature 2018. | en_US |
| dc.identifier.doi | 10.1007/978-3-319-94830-0_11 | |
| dc.identifier.endpage | 292 | en_US |
| dc.identifier.issn | 1931-6828 | |
| dc.identifier.scopus | 2-s2.0-85054179839 | en_US |
| dc.identifier.scopusquality | N/A | en_US |
| dc.identifier.startpage | 265 | en_US |
| dc.identifier.uri | https://doi.org/10.1007/978-3-319-94830-0_11 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.14619/9643 | |
| dc.identifier.volume | 139 | en_US |
| dc.indekslendigikaynak | Scopus | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Springer International Publishing | en_US |
| dc.relation.ispartof | Springer Optimization and Its Applications | en_US |
| dc.relation.publicationcategory | Kitap Bölümü - Uluslararası | en_US |
| dc.rights | info:eu-repo/semantics/closedAccess | en_US |
| dc.title | Network design problem with cut constraints | en_US |
| dc.type | Book Part | en_US |
