haku: @indexterm ALGORITHMS / yhteensä: 403
viitteet: 150-159 / 403
« edellinen sivu | seuraava sivu »
 otsikkovuositekijä
150.
An algorithm for solving dynamic capacitated plant location problems with discrete expansion sizes
Operations Research
1991 : MAY-JUN, VOL. 39:3, p. 423-437
 1991 Shulman, A.
151.
Optimal assignment of components to parallel-series and series-parallel systems
Operations Research
1991 : MAY-JUN, VOL. 39:3, p,. 407-414
 1991 Prasad, V. R.
Nair, K. P. K.
152.
On the single-machine scheduling problem with tardiness penalties
Journal of the Operational Research Society
1991 : AUG, VOL. 42:8, p. 695-702
 1991 Sen, T.
Borah, B. N.
153.
Two-dimensional cutting stock with multiple stock sizes
Journal of the Operational Research Society
1991 : AUG, 42:8, p. 673-83
 1991 Yanasse, H. H.
Zinober, A. S. I.
Harros, R. G.
154.
Textile production systems: a succession of non-identical parallel processor shops
Journal of the Operational Research Society
1991 : AUG, VOL. 42:8, p. 655-71
 1991 Guinet, A.
155.
A Simple Algorithm for the Mathematical Programming Approach to Joint Cost Allocation for Decision Making (Demand-Adjusted-Sales-Value Algorithm)
Decision Sciences
1991 : JUL/AUG, VOL. 22:3, p. 500-511
 1991 Cheng, C.S.A.
156.
Algorithms for multiplex bundling in a telecommunications network.
Operations Research
1991 : NOV-DEC, VOL. 39:6, p. 925-944
 1991 Doverspike, R. D.
157.
A strongly polynomial algorithm for a special class of linear programs.
Operations Research
1991 : NOV-DEC, VOL. 39:6, p. 955-960
 1991 Adler, I.
Cosares, S.
158.
Routing printed circuit cards through an assembly cell.
Operations Research
1991 : NOV-DEC, VOL. 39:6, p. 992-1004
 1991 Lofgren, C. B.
McGinnis, L. F.
Tovey, C. A.
159.
A queuing network model for analysing a class of branch-and-bound algorithms on a master-slave architecture.
Operations Research
1991 : NOV-DEC, VOL. 39:6, p. 1005-1017
 1991 Boxma, O. J.
Kindervater, G. A. P.
« edellinen sivu | seuraava sivu »
SCIMA