Sharifov, FirdovsiKutucu, Hakan2024-09-292024-09-2920150399-05591290-3868https://doi.org/10.1051/ro/2014038https://hdl.handle.net/20.500.14619/5542In 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.eninfo:eu-repo/semantics/openAccessNetwork design problemlinear programmingBranch-and-Bound methodmatchingArticle10.1051/ro/20140382-s2.0-849213244773122Q329749WOS:000348134500005Q4