haku: @indexterm ALGORITHMS / yhteensä: 403
viitteet: 154-163 / 403
« edellinen sivu | seuraava sivu »
 otsikkovuositekijä
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.
160.
Two-machine super-shop scheduling problem
Journal of the Operational Research Society
1991 : JUN, VOL. 42:6, p. 479-492
 1991 Strusevich, V.A.
161.
Medi-centre location problems
Journal of the Operational Research Society
1991 : APR, VOL. 42:4, p. 313-322
 1991 Berman, O.
Yang, E.K.
162.
Computing Cournot-Nash equilibria.
Operations Research
1991 : SEP-OCT, VOL. 39:5, p. 739-748
 1991 Kolstad, C. D.
Mathiesen, L.
163.
Strongly polynomial algorithms for the high multiplicity scheduling problem.
Operations Research
1991 : JUL-AUG, VOL. 39:4, p. 648-654
 1991 Hochbaum, D. S.
Shamir, R.
« edellinen sivu | seuraava sivu »
SCIMA