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

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

# 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	2
1	4	17
1	5	2
1	6	9
1	8	12
2	3	2
2	5	17
2	8	7
3	4	11
4	5	16
5	6	6
5	7	19
5	8	13
6	8	9
;

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

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

# 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	33	59	99	132	264	495
2	55	99	165	220	440	825
3	34	61	102	136	272	510
4	44	79	132	176	352	660
5	36	65	108	144	288	540
;

# The switch costs
param f:
	4	8	16	20	40	80	 :=
1	8	14	23	31	63	119
2	9	15	26	35	71	134
3	7	12	20	27	55	104
4	6	10	17	23	47	89
5	5	9	15	20	40	75
6	4	7	12	16	32	60
;


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


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


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


# 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;
set Pk[18] := 18;
set Pk[19] := 19;


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


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

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