search query: @indexterm COMBINATIONAL OPTIMIZATION / total: 8
references: 2-8 / 8
« previous page | next page »
 titleyearauthor
2.
Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge
European Journal of Operational Research
1995 : SEP 21, VOL. 85:3, p. 515-531
 1995 Zegordi, S.
Itoh, K.
Enkawa, T.
3.
A bound for the Symmetric Travelling Salesman Problem through matroid formulation
European Journal of Operational Research
1995 : JUN 8, VOL. 83:2, p. 301-309
 1995 Cowling, P.
Maffioli, F.
4.
A parallel depth first search branch and bound algorithm for the quadratic assignment problem
European Journal of Operational Research
1995 : MAR 16, VOL. 81:3, p. 617-628
 1995 Mans, B.
Mautor, T.
Roucariol, C.
5.
Solving location-allocation problems with rectilinear distances by simulated annealing
Journal of the Operational Research Society
1994 : NOV, VOL. 45:11, p. 1304-1315
 1994 Liu, C-M
Kao, R-L.
Wang, A-H.
6.
A Tabu search approach for delivering pet food and flour in Switzerland
Journal of the Operational Research Society
1994 : NOV, VOL. 45:11, p. 1233-1246
 1994 Rochat, Y.
Semet, F.
7.
A rigorous computational comparison of alternative solution methods for the generalized assignment problem
Management Science
1994 : JUL, VOL. 40:7, p. 868-890
 1994 Amini, M.
Racer, M.
8.
Benchmarks for basic scheduling problems
European Journal of Operational Research
1993 : JAN 22, VOL. 64:2, p. 278-284
 1993 Taillard, E.
« previous page | next page »
SCIMA