A subgradient-based branch-and-bound algorithm for the ...
A subgradient-based branch-and-bound algorithm for the ... A subgradient-based branch-and-bound algorithm for the ...
from data.imf.au.dk
More from this publisher
06.08.2013
Views
*----------------------------------------------------------------*/ void gendepots ( void ) { /* generate depots with capacity s[j] = 10 + u [0 ,150] and fixed cost f[j] = (u [0 ,10] + 100)* sqrt (s[j ])+ u [0 ,90] */ int j; double ff; double corr ; totc = 0; for (j =0;j
fprintf (out ,"% -s %-d %-d\n"," Dim ",n,m); for (j =0;j 0){ f = ( int *) calloc (n, sizeof ( int ) ); 35
- Page 1: DEPARTMENT OF OPERATIONS RESEARCH U
- Page 4 and 5: customer i’s demand from facility
- Page 6 and 7: otherwise a “null step” is perf
- Page 8 and 9: global upper bound computed so far,
- Page 10 and 11: Table 1 Comparison of B&P and BB-SG
- Page 12 and 13: Table 3 Comparison of CAPLOC and BB
- Page 14 and 15: Table 6 Comparison of CPLEX and BB-
- Page 16 and 17: Table 9 Comparison of CPLEX, B&C an
- Page 18 and 19: Table 11 Comparison of CPLEX and BB
- Page 20 and 21: Table 12 Comparison of BB-SG and BB
- Page 22 and 23: position method for two stage stoch
- Page 24 and 25: Table A.2 Detailed results on insta
- Page 26 and 27: B Detailed results obtained with BB
- Page 28 and 29: Table B.3 Detailed results on insta
- Page 30 and 31: C Detailed results obtained with BB
- Page 32 and 33: Table C.2 Detailed results on insta
- Page 34 and 35: Table C.4 Detailed results on insta
- Page 38 and 39: } } d = ( int *) calloc (m, sizeof
- Page 40: libs = -lm $( main ): $( obj ) $( L
fprintf (out ,"% -s %-d %-d\n"," Dim ",n,m);<br />
<strong>for</strong> (j =0;j 0){<br />
f = ( int *) calloc (n, sizeof ( int ) );<br />
35
Change language