haku: @indexterm ALGORITHMS / yhteensä: 403
viitteet: 119-128 / 403
« edellinen sivu | seuraava sivu »
 otsikkovuositekijä
119.
Compational results of multiserver bulk-arrival queues with constant service time Mx/D/c
Operations Research
1992 : MAY-JUNE, VOL. 40:2, SUPPLEMENT 2, p. S229-S238
 1992 Chaudry, M.L.
Templeton, J.G.C.
Medhi, J.
120.
Deducing queuing from transactional data: the queue inference engine, revisited
Operations Research
1992 : MAY-JUNE, VOL. 40:2, SUPPLEMENT 2, p. S217-S229
 1992 Bertsimas, D.J.
Servi, L.D.
121.
Economic lot sizing: an O(n log n) algorithm that runs in linear time in the Wagner-Whitin case
Operations Research
1992 : JAN-FEB, VOL. 40:1, SUPPLEMENT 1, p. S145-S156
 1992 Wagelmans, A.
Hoesel, S.V.
Kolen, A.
122.
A tie-breaking rule for discrete infinite horizon optimization
Operations Research
1992 : JAN-FEB, VOL. 40:1, SUPPLEMENT 1, p. S117-S126
 1992 Ryan, S.M.
Bean, J.C.
Smith, R.L.
123.
Approximation algorithms for fixed job schedule problems
Operations Research
1992 : JAN-FEB, VOL. 40:1, SUPPLEMENT 1, p. S96-S108
 1992 Fischetti, M.
Martello, S.
Toth, P.
124.
Fixed job scheduling with two types of processors
Operations Research
1992 : JAN-FEB, VOL. 40:1, SUPPLEMENT 1, p. S76-S85
 1992 Dondeti, V.R.
Emmons, H.
125.
m-Median and m-Center problems with mutual communication: solvable special cases
Operations Research
1992 : JAN-FEB, VOL. 40:1, SUPPLEMENT 1, p. S56-S66
 1992 Chhajed, D.
Lowe, T.J.
126.
A multiplier adjustment approach for the set partitioning problem
Operations Research
1992 : JAN-FEB, VOL. 40:1, SUPPLEMENT 1, p. S40-S47
 1992 Chan, T.J.
Yano, C.A.
127.
When is the classroom assignment problem hard?
Operations Research
1992 : JAN-FEB, VOL. 40:1, SUPPLEMENT 1, p. S28-S39
 1992 Carter, M.W.
Tovey, C.A.
128.
The scaling network simplex algorithm
Operations Research
1992 : JAN-FEB, VOL. 40:1, SUPPLEMENT 1, p. S5-S13
 1992 Ahuja, R.K.
Orlin, J.B.
« edellinen sivu | seuraava sivu »
SCIMA