# Problem instance J05 with no translation.
# The set of nodes in the network
set N := 1 2 3 4 5 6 7 8 9;

# The set of links in the network
set E :=
(1,3)   (2,5)   (3,7)   (4,6)   (5,6)   (6,9)   (7,9)
(1,8)   (2,9)   (3,9)   (4,7)   (5,9)   (7,8);

# The set of modular sizes for structures and couplers
set W := 4 8 16 20 40 80;

# The set of OD pairs and 
# the number wavelengths required for each o-d pair
param: D: r :=
1	3	8
1	6	10
1	7	11
2	3	9
2	5	13
2	6	10
3	5	11
3	6	7
4	8	4
5	7	12
6	7	3
6	8	6
7	8	2
7	9	9
8	9	13
;

# The set of available structures
set S := 1 2 3 4 5;

# The edges in each structure
set Es[1] := (2,5) (2,9) (5,9);
set Es[2] := (3,7) (3,9) (4,6) (4,7) (6,9) (7,9);
set Es[3] := (1,3) (1,8) (3,7) (7,8);
set Es[4] := (5,6) (5,9) (6,9);
set Es[5] := (4,6) (4,7) (6,9) (7,9);

# The set of available switches
set C := 1 2 3 4 5 6;

# The structure costs
param a:
	4	8	16	20	40	80	 :=
1	28	50	84	112	224	420
2	25	45	75	100	200	375
3	23	41	69	92	184	345
4	27	49	81	108	216	405
5	26	47	78	104	208	390
;

# The switch costs
param f:
	4	8	16	20	40	80	 :=
1	2	3	6	8	16	30
2	9	15	26	35	71	134
3	8	14	23	31	63	119
4	14	24	41	55	111	209
5	13	22	38	51	103	194
6	14	24	41	55	111	209
;


# The set of optical cycle
set K := 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17;


# The set of optical cycles serving each demand pair
set J[1,3] := 1;
set J[1,6] := 2;
set J[1,7] := 3;
set J[2,3] := 4;
set J[2,5] := 5;
set J[2,6] := 6;
set J[3,5] := 7;
set J[3,6] := 8;
set J[4,8] := 9;
set J[5,7] := 10;
set J[6,7] := 11 12;
set J[6,8] := 13;
set J[7,8] := 14;
set J[7,9] := 15 16;
set J[8,9] := 17;


# The set of paths
set P := 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17;


# The set of paths making up each optical cycle
set Pk[1] := 1;
set Pk[2] := 2;
set Pk[3] := 3;
set Pk[4] := 4;
set Pk[5] := 5;
set Pk[6] := 6;
set Pk[7] := 7;
set Pk[8] := 8;
set Pk[9] := 9;
set Pk[10] := 10;
set Pk[11] := 11;
set Pk[12] := 12;
set Pk[13] := 13;
set Pk[14] := 14;
set Pk[15] := 15;
set Pk[16] := 16;
set Pk[17] := 17;


# The set of paths using each switch
set L[3] := 2 9 13 17;
set L[6] := 2 9 13 17;
set L[2] := 4 6 7 10;
set L[1] := 4 6;
set L[4] := 4 7 10;
set L[5] := 4 7 10;


# The set of paths using each edge of each structure
set Pes[1,3,3] := 1 2 3 9 13 14 17;
set Pes[1,8,3] := 1 2 3 9 13 14 17;
set Pes[7,8,3] := 1 2 3 9 13 14 17;
set Pes[3,7,3] := 1 3 14;
set Pes[3,9,2] := 2 4 7 8 13 17;
set Pes[6,9,2] := 2 6 8 11 13 15;
set Pes[7,9,5] := 2 12 13 16 17;
set Pes[6,9,5] := 2 12 13 16;
set Pes[2,9,1] := 4 5 6;
set Pes[2,5,1] := 4 5 6;
set Pes[5,6,4] := 4 6 7 10;
set Pes[4,6,5] := 4 7 10 12 16;
set Pes[4,7,2] := 4 7 8 9 10 11 15;
set Pes[3,7,2] := 4 7 8 9;
set Pes[5,9,1] := 5 7 10;
set Pes[4,6,2] := 8 11 15;
set Pes[4,7,5] := 9 12 16;
set Pes[7,9,2] := 10 11 15;

set H :=
(1,2)     (2,9)     (3,17)    (4,16)    (7,8)     (8,11)    (9,17)    (13,15)
(1,3)     (2,11)    (4,5)     (4,17)    (7,9)     (8,13)    (10,11)   (13,16)
(1,9)     (2,12)    (4,6)     (5,6)     (7,10)    (8,15)    (10,12)   (13,17)
(1,13)    (2,13)    (4,7)     (5,7)     (7,11)    (8,17)    (10,15)   (14,17)
(1,14)    (2,14)    (4,8)     (5,10)    (7,12)    (9,10)    (10,16)   (16,17)
(1,17)    (2,15)    (4,9)     (6,7)     (7,13)    (9,11)    (11,13)
(2,3)     (2,16)    (4,10)    (6,8)     (7,15)    (9,12)    (11,15)
(2,4)     (2,17)    (4,11)    (6,10)    (7,16)    (9,13)    (12,13)
(2,6)     (3,9)     (4,12)    (6,11)    (7,17)    (9,14)    (12,16)
(2,7)     (3,13)    (4,13)    (6,13)    (8,9)     (9,15)    (12,17)
(2,8)     (3,14)    (4,15)    (6,15)    (8,10)    (9,16)    (13,14);