Author:
Pastukhov Grigory,Veremyev Alexander,Boginski Vladimir,Pasiliao Eduardo L.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference31 articles.
1. Balasundaram B, Butenko S, Trukhanov S (2005) Novel approaches for analyzing biological networks. J Comb Optim 10:23–39
2. Bang-Jensen J, Chiarandini M, Morling P (2010) A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation. Networks 55(4):299–325
3. Bang-Jensen J, Jordán T (1998) Edge-connectivity augmentation preserving simplicity. SIAM J Discrete Math 11(4):603–623
4. Bendali F, Diarrassouba I, Mahjoub AR, Mailfert J (2010) The k edge-disjoint 3-hop-constrained paths polytope. Discrete Optim 7(4):222–233
5. Botton Q, Fortz B, Gouveia L, Poss M (2011) Benders decomposition for the hop-constrained survivable network design problem. INFORMS J Comput. doi: 10.1287/ijoc.1110.0472
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献