TSNDLib

name	nodes	source	problems	published experiments	remarks
grid	100-8100	[1]	all	2RPCSN([2]), 2NCON([3]])
extended grid	100-900	to be published	all	to be published
real-world	197, 1757	[1]	all	2RPCSN([2]), 2NCON([3])
extended real-world	197, 1757	to be published	all	to be published
PCSTLib+	100, 200, 400	[1]	all	2RPCSN([2]), 2NCON([3])
TSPLIB-based delauney triangulations	29-4461	[7]	all	2NCON ([3])
TSPLIB		[6],[4]	spanning	[4]	complete graphs with euclidean distances For these graphs {2}-NCON and {2}-ECON are equivalent problems and therefore is undirected formulation with additional valid inequalities (node-partition and F-partition) for {2}-NCON more appropriate. However, for {1,2}-ECON it is already not the case.
TSPLIBplus		to be published	spanning	to be published	complete graphs with euclidean distances For these graphs {2}-NCON and {2}-ECON are equivalent problems and therefore is undirected formulation with additional valid inequalities (node-partition and F-partition) for {2}-NCON more appropriate. However, for {1,2}-ECON it is already not the case. We generated instances with the following customer settings (C₁,C₂)=(0,25),(0,50),(0,75),(0,100), (10,10),(25,25), (25,75), (50,50),(75,25)

[1]	P. Bachhiesl. The OPT- and the SST-problems for real world access network design - basic definitions and test instances. Working Report NetQuest 01/2005, Carinthia Tech Institute, Klagenfurt, Austria, 2005
[2]	M. Chimani, M. Kandyba, P. Mutzel. A new ILP formulation for 2-root-connected prize-collecting Steiner networks. Proceedings of 15th Annual European Symposium on Algorithms (ESA'07), volume 4698 of LNCS, pages 681-692, Springer, 2007
[3]	M. Chimani, M. Kandyba, I. Ljubic, P. Mutzel. Strong Formulations for 2-Node-Connected Steiner Network Problems. To appear at 2nd Annual International Conference on Combinatorial Optimization and Applications (COCOA'08), St. John's, Newfoundland, 2008.
[4]	H. Kerivin, A. R. Mahjoub and C. Nocq (1,2)-Survivable networks: Facets and branch-and-cut. The Sharpest Cut, MPS-SIAM Series in Optimization, M. Grötschel (Editor), pages 121-152, 2004
[5]	S. Raghavan Formulations and Algorithms for the Network Design Problems with Connectivity Requirements PhD Thesis, MIT, Cambridge, MA, 1995
[6]	http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/
[7]	D. Wagner. Generierung und Adaptierung von Testanzen für das OPT und SST Problem. Technical Report 03/2007, Carinthia Tech Institute, Klagenfurt, Austria, 2007. In german.