Network design problem with cut constraints
Küçük Resim Yok
Tarih
2018
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Springer International Publishing
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
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.
Açıklama
Anahtar Kelimeler
Kaynak
Springer Optimization and Its Applications
WoS Q Değeri
Scopus Q Değeri
N/A
Cilt
139
