A NETWORK DESIGN PROBLEM WITH TWO-EDGE MATCHING FAILURES
Küçük Resim Yok
Tarih
2015
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Edp Sciences S A
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
In 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.
Açıklama
Anahtar Kelimeler
Network design problem, linear programming, Branch-and-Bound method, matching
Kaynak
Rairo-Operations Research
WoS Q Değeri
Q4
Scopus Q Değeri
Q3
Cilt
49
Sayı
2
