haku: @indexterm ALGORITHMS / yhteensä: 403
viitteet: 259-268 / 403
« edellinen sivu | seuraava sivu »
 otsikkovuositekijä
259.
Experimental test of MCDM algorithms in a modular approach.
European Journal of Operational Research
1985 : NOV, VOL. 22:2, p. 159-166
 1985 Brockhoff, K.
260.
An empirical derivation of the dimensions along which characteristics of jobs are perceived.
Academy of Management Journal
1985 : JUN, VOL. 28:2, p. 376-396
 1985 Stone, E. F.
Gueutal, H. G.
261.
A modification of the Geoffrion/Dyer/Feinberg algorithm for finite multi-objective systems.
European Journal of Operational Research
1985 : JUL, VOL. 21:1, p. 113-120
 1985 White, D. J.
262.
A new polynomially bounded shortest path algorithm.
Operations Research
1985 : JAN-FEB, VOL. 33:1, p. 65-73
 1985 Glover, F.
Klingman, D.
Phillips, N.
263.
Generalized fractional programming : Algorithms and numerical experimentation.
European Journal of Operational Research
1985 : APR, VOL. 20:1, p. 92-101
 1985 Ferland, J. A.
Potvin, J-Y.
264.
Clustering for routing in densely populated areas.
European Journal of Operational Research
1985 : APR, VOL. 20:1, p. 48-57
 1985 Chapleau, L.
Ferland, J. A.
Rousseau, J-M.
265.
A restriction and feasible direction algorithm for a capacity expansion problem.
European Journal of Operational Research
1985 : MAR, VOL. 19:3, p. 345-361
 1985 Sherali, H. D.
266.
Scheduling lots of dependent unit-time operations on identical machines to minimize schedule lenght.
European Journal of Operational Research
1985 : MAR, VOL. 19:3, p. 331-336
 1985 Sawik, T. J.
267.
A polynomial algorithm for minimum quadratic cost flow problems.
European Journal of Operational Research
1984 : VOL. 18:3, p. 377-387
 1984 Minoux, M.
268.
An algorithm for ranking paths that may contain cycles.
European Journal of Operational Research
1984 : VOL. 18:1, p. 123-130
 1984 Queiros Vieira Martins, E. de
« edellinen sivu | seuraava sivu »
SCIMA