Part of the Network Theory and Applications book series (NETA, volume 2)
We present in this chapter numerical results obtained for the 2CNBR problem, with the Branch-and-Cut algorithm as well as the different heuristics presented in Chapter 7.
KeywordsComputational Result Edge Length Real Application Random Network Survivable Network
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
© Springer Science+Business Media Dordrecht 2000