haku: @indexterm ALGORITHMS / yhteensä: 403
viitteet: 189-198 / 403
« edellinen sivu | seuraava sivu »
 otsikkovuositekijä
189.
Performance of shortest path algorithms in network flow problems.
Management Science
1990 : JUN, VOL. 36:6, p. 661-673
 1990 Divoky, J. J.
Hung, M. S.
190.
A branch-and-fathom algorithm for the long range process design problem.
Management Science
1990 : APR, VOL. 36:4, p. 513-516
 1990 Singhal, J.
Katz, J. L.
191.
A new algorithm for computing the maximal closure of a graph.
Management Science
1990 : MAR, VOL. 36:3, p. 315-331
 1990 Faaland, B.
Kim, K.
Schmitt, T.
192.
An approximate analysis of open tandem queueing networks with blocking and genral service times.
European Journal of Operational Research
1990 : MAY 4, VOL. 46:1, p. 123-135
 1990 Jun, K. P.
Perros, H. G.
193.
On the numerical realization of the exact penalty method for quadratic programming algorithms.
European Journal of Operational Research
1990 : JUN 15, VOL. 46:3, p. 404-408
 1990 Körner, F.
194.
On duality for Boolean programming.
European Journal of Operational Research
1990 : JUN 15, VOL. 46:3, p. 399-403
 1990 Körner, F.
195.
On the resemblance between the Kornai-Liptak and cross decomposition techniques for block-angular linear programs.
European Journal of Operational Research
1990 : JUN 15, VOL. 46:3, p. 393-398
 1990 Aardal, K.
Ari, A.
196.
An improved algorithm for the non-guillotine-constrained cutting-stock problem.
Journal of the Operational Research Society
1990 : FEB, VOL. 41:2, p. 141-149
 1990 Ghandforoush, P.
Daniels, J. J.
197.
Weighted matching in chess tournaments.
Journal of the Operational Research Society
1990 : JAN, VOL. 41:1, p. 17-24
 1990 Olafsson, S.
198.
La diversification internationale.
Gestion 2000
1990 : FEB-MAR, VOL. 6:1, p. 15-30
 1990 Audistere, N.
Beer, F.
« edellinen sivu | seuraava sivu »
SCIMA