References
- ArmonyMKlincewiczJGLussHRosenweinMBDesign of stacked self-healing rings using a genetic algorithmJ Heuristics200068510510.1023/A:1009665726946
- BalakrishnanAMagnantiTLMirchandaniPBNetwork designAnnotated Bibliographies in Combinatorial Optimization1997
- BalakrishnanAMagnantiTLMirchandaniPBDesigning hierarchical survivable networksOpns Res19984611613610.1287/opre.46.1.116
- Cabral EA, Erkut E, Laporte G and Tjandra SA (2005). The shortest path problem with relays. Unpublished manuscript.
- Cabral EA, Erkut E, Laporte G and Patterson RA (2007). The network design problem with relays. Eur J Opl Res, 180: 834–844.
- ChamberlandSSansòBTopological expansion of multiple-ring metropolitan area networksNetworks20003621022410.1002/1097-0037(200012)36:4<210::AID-NET2>3.0.CO;2-Z
- ChamberlandSSansòBOn the design problem of multitechnology networksINFORMS Journal on Computing20011324525610.1287/ijoc.13.3.245.12633
- ChamberlandSSansòBMarcotteOTopological design of two-level telecommunication networks with modular switchesOpns Res20004874576010.1287/opre.48.5.745.12412
- ChopraSTsaiC-YA branch-and-cut approach for minimum cost multi-level network designDisc Math2002242659210.1016/S0012-365X(00)00404-0
- CostaAMA survey on Benders decomposition applied to fixed-charge network design problemsComput Opl Res2005321429145010.1016/j.cor.2003.11.012
- CostaAMCordeauJ-FLaporteGSteiner tree problems with profitsINFOR20064499115
- DoverspikeRSanieeIHeuristic Approaches for Telecommunications Network Management, Planning and Expansion2000
- GavishBTopological design of computer communication networks—The overall design problemEur J Opl Res19925814917210.1016/0377-2217(92)90204-M
- GloverFFuture paths for integer programming and links to artificial intelligenceComput Opl Res19861353354910.1016/0305-0548(86)90048-1
- GzaraFGoffinJ-LExact solution of the centralized network design problem on directed graphsNetworks20054518119210.1002/net.20061
- KerivinHMahjoubARDesign of survivable networks: A surveyNetworks20054612110.1002/net.20072
- KochTMartinASolving Steiner tree problems in graphs to optimalityNetworks19983220723210.1002/(SICI)1097-0037(199810)32:3<207::AID-NET5>3.0.CO;2-O
- LabbéMLaporteGRodrigues MartínISalazar GonzálezJJThe ring star problem: Polyhedral analysis and exact algorithmNetworks20044317718910.1002/net.10114
- LucenaABeasleyJEA branch and cut algorithm for the Steiner problem in graphsNetworks199831395910.1002/(SICI)1097-0037(199801)31:1<39::AID-NET5>3.0.CO;2-L
- MagnantiTLRaghavanSStrong formulations for network design problems with connectivity requirementsNetworks200545617910.1002/net.20046
- PattersonRAPirkulHRollandEA memory adaptive reasoning technique for solving the capacitated minimum spanning tree problemJ Heuristics1999515918010.1023/A:1009629727566
- PolzinTVahdati DaneshmandSA comparison of Steiner tree relaxationsDisc Appl Math200111224126110.1016/S0166-218X(00)00318-8
- PolzinTVahdati DaneshmandSImproved algorithms for the Steiner problem in networksDisc Appl Math200111226330010.1016/S0166-218X(00)00319-X
- PolzinTVahdati DaneshmandSOn Steiner trees and minimum spanning trees in hypergraphsOpns Res Lett200331122010.1016/S0167-6377(02)00185-2
- RaghavanSMagnantiTLNetwork connectivityAnnotated Bibliographies in Combinatorial Optimization1997
- RandazzoCDLunaHPLA comparison of optimal methods for local access uncapacitated network designAnn Opns Res200110626328610.1023/A:1014569927266
- SansòBSorianoPTelecommunications Network Planning1999
- TakahashiHMatsuyamaAAn approximate solution for the Steiner problem in graphsMath Japon198024573577