haku: @indexterm ALGORITHMS / yhteensä: 403
viitteet: 210-219 / 403
« edellinen sivu | seuraava sivu »
 otsikkovuositekijä
210.
An exact algorithm for the quadratic assignment problem on a tree.
Operations Research
1989 : SEP-OCT, VOL. 37:5, p. 760-768
 1989 Christofides, N.
Benavent, E.
211.
A fast and simple algorithm for the maximum flow problem.
Operations Research
1989 : SEP-OCT, VOL. 37:5, p. 748-759
 1989 Ahuja, R. K.
Orlin, J. B.
212.
A dual-ascent procedure for large-scale uncapacitated network design.
Operations Research
1989 : SEP-OCT, VOL. 37:5, p. 716-740
 1989 Balakrishnan, A.
Magnanti, T. L.
Wong, R. T.
213.
New sharpness properties, algorithms and complexity bounds for partitioning shortest path procedures.
Operations Research
1989 : JUL-AUG, VOL. 37:4, p. 542-546
 1989 Glover, F.
Klingman, D.
214.
Combining algorithms based on robust estimation techniques and co-integrating restrictions. (!Combining forecasts)
Journal of Forecasting
1989 : JUL-SEP, VOL. 8:3, p. 189-198
 1989 Hallman, J.
Kamstra, M.
215.
A repairable item inventory system with diagnostic and repair service.
European Journal of Operational Research
1989 : MAY 25, VOL. 40:2, p. 210-221
 1989 Lee, H. L.
Moinzadeh, K.
216.
Dual algorithms for pure network problems.
Operations Research
1989 : JAN-FEB, VOL. 37:1, p. 159-171
 1989 Ali, A. I.
Padman, R.
Thiagarajan, H.
217.
A simple algorithm for solving small, fixed-charge transportation problems.
Journal of the Operational Research Society
1988 : MAY, VOL. 39:5, p. 467-476
 1988 Sandrock, K.
218.
An effective method of balancing the workload amongst salesmen.
Omega
1988 : VOL. 16:2, p. 159-163
 1988 Okonjo-Adigwe, C.
219.
A simple algorithm for the portfolio selection problem.
Journal of Finance
1988 : MAR, VOL. 43:1, p. 71-82
 1988 Lewis, A. L.
« edellinen sivu | seuraava sivu »
SCIMA