haku: @indexterm ALGORITHMS / yhteensä: 403
viitteet: 123-132 / 403
« edellinen sivu | seuraava sivu »
 otsikkovuositekijä
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.
129.
Determination of optimal design parameters of an X control chart
Journal of the Operational Research Society
1992 : DEC, VOL. 43:12, p. 1151-1157
 1992 Chung, K.-J.
130.
An exact sublinear algorithm for the max-flow, vertex disjoint paths and communication problems on random graphs
Operations Research
1992 : SEP-OCT, VOL. 40:5, p. 923-935
 1992 Hochbaum, D.S.
131.
Computational results with a cutting-plane algorithm for designing communication networks with low-connectivity constraints
Operations Research
1992 : MAR-APR, VOL.40:2, p.309-330
 1992 Grotschel, M.
Monma, C.L.
Stoer, M.
132.
Balanced loading
Operations Research
1992 : MAR-APR, VOL.40:2, p.238-246
 1992 Amiouny, S.V.
« edellinen sivu | seuraava sivu »
SCIMA