A branch-and-cut algorithm for two-level survivable network design problems

Simple item page
dc.citation.epage112en_US
dc.citation.spage102en_US
dc.citation.volumeNumber67en_US
dc.contributor.authorRodríguez-Martín, I.en_US
dc.contributor.authorSalazar-González, J-J.en_US
dc.contributor.authorYaman, H.en_US
dc.date.accessioned2018-04-12T10:55:40Z
dc.date.available2018-04-12T10:55:40Z
dc.date.issued2016en_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.description.abstractThis paper approaches the problem of designing a two-level network protected against single-edge failures. The problem simultaneously decides on the partition of the set of nodes into terminals and hubs, the connection of the hubs through a backbone network (first network level), and the assignment of terminals to hubs and their connection through access networks (second network level). We consider two survivable structures in both network levels. One structure is a two-edge connected network, and the other structure is a ring. There is a limit on the number of nodes in each access network, and there are fixed costs associated with the hubs and the access and backbone links. The aim of the problem is to minimize the total cost. We give integer programming formulations and valid inequalities for the different versions of the problem, solve them using a branch-and-cut algorithm, and discuss computational results. Some of the new inequalities can be used also to solve other problems in the literature, like the plant cycle location problem and the hub location routing problem.en_US
dc.description.provenanceMade available in DSpace on 2018-04-12T10:55:40Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 179475 bytes, checksum: ea0bedeb05ac9ccfb983c327e155f0c2 (MD5) Previous issue date: 2016en
dc.identifier.doi10.1016/j.cor.2015.09.008en_US
dc.identifier.eissn1873-765X
dc.identifier.issn0305-0548
dc.identifier.urihttp://hdl.handle.net/11693/36858
dc.language.isoEnglishen_US
dc.publisherElsevieren_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/j.cor.2015.09.008en_US
dc.source.titleComputers & Operations Researchen_US
dc.subjectBranch-and-cuten_US
dc.subjectHierarchical networksen_US
dc.subjectNetwork designen_US
dc.subjectSurvivabilityen_US
dc.subjectValid inequalitiesen_US
dc.subjectAlgorithmsen_US
dc.subjectInteger programmingen_US
dc.subjectHierarchical networken_US
dc.titleA branch-and-cut algorithm for two-level survivable network design problemsen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
A_branch-and-cut_algorithm_for_two-level_survivable_network_design_problems.pdf
Size:
401.54 KB
Format:
Adobe Portable Document Format
Description:
Full Printable Version
Download

Collections

Scholarly Publications - Industrial Engineering