// NAME
d5_ord25
// ID
1
// NB ORDERS
25
// SOL (NbOrders IdOrder1 IdOrder2 ...)
0
// VAL
0.0
// IS OPTIMAL?
1
// TIME (sec)
21.72
// SOLVING ALGORITHM
BeamSearch
// PRIZES ORDERS
-126.29508067157546
-76.45469364685971
-79.06825157457222
...
// NB GROUP PICKED
5
// GROUP PICKED
// NbOrders IdOrder1 IdOrder2 ...
24	0	1	2	3	4	5	6	7	8	9	10	11	12	13	14	15	17	18	19	20	21	22	23	24	
24	0	1	2	3	4	6	7	8	9	10	11	12	13	14	15	16	17	18	19	20	21	22	23	24	
...	
// PRIZES GROUP PICKED
-131.52938699011784
-27.620065281299258
...
// NB SUBSET ROWS
77
// SUBSET ROWS
// Q NbOrders IdOrder1 coefOrder1 IdOrder2 coefOrder2 ...
2	3	15	1	7	1	5	1	
2	3	0	1	3	1	2	1		
...	
3	4	20	2	13	1	10	1	1	1	
3	4	20	2	17	1	13	1	1	1		
...
// PRIZES SUBSET ROWS
0.9730654674185644
5.040583726190828
...