AFM instances
----------------

These instances are described in: 
J. Aráoz, E. Fernández and O. Meza, 
"Solving the Prize-Collecting Rural Postman Problem",
European Journal of Operational Research 196 (3), 886-896 (2009).

Set: name of the set of instances
V: number of vertices (i-j: i<=V<=j)
E: number of edges (i-j: i<=E<=j)

Set #instances 	V 	E
D16	 9 	16 	31-32
D36 	 9 	36 	72
D64 	 9 	64 	128
D100	 9 	100	200
G16 	 9 	16 	24
G36 	 9 	36 	60
G64 	 9 	64 	112
G100 	 9 	100	180
R20 	 5 	20 	37-75
R30 	 5 	30 	70-112
R40 	 5 	40 	82-203
R50 	 5 	50 	130-203
P 	24	7-50 	10-184
AlbaidaA 1 	102 	160
AlbaidaB 1 	90 	144


BCD instances
----------------

These instances are described in 
"A branch-and-cut algorithm for the Maximum Benefit Chinese Postman Problem" 
by Corberán, Plana. Rodríguez-Chía and Sanchis (2011).

Name: name of the instance
V: number of vertices
E: number of edges


Name	V	E
B321	318	630
B351	453	811
B371	490	873
B421	357	884
B451	465	1055
B471	498	1114
B521	388	1106
B551	488	1318
B571	498	1326
B621	409	1392
B651	491	1532
B671	498	1537
C321	502	1013
C351	691	1236
C371	737	1319
C421	534	1339
C451	711	1605
C471	746	1693
C521	582	1705
C551	718	1920
C571	749	2005
C621	622	2080
C651	739	2288
C671	750	2269
D321	661	1297
D351	902	1611
D371	979	1738
D421	708	1867
D451	947	2161
D471	996	2182
D521	783	2361
D551	965	2643
D571	999	2678
D621	817	2793
D651	985	3036
D671	999	3073