haku: @indexterm Algorithms / yhteensä: 403
viitteet: 29-38 / 403
« edellinen sivu | seuraava sivu »
 otsikkovuositekijä
29.
Tutorial on Computational Complexity
Interfaces
2002 : MAY-JUN, VOL. 32:3, p. 30-61
 2002 Tovey, C. A.
30.
Bounding Option Prices by Semidefinite Programming: A Cutting Plane Algorithm
Management Science
2002 : MAY, VOL. 48:5, p. 665-678
 2002 Gotoh, J.-y.
Konno, H.
31.
Capacity Acquisition, Subcontracting, and Lot Sizing
Management Science
2001 : AUG, VOL. 47:8, p. 1081-1100
 2001 Atamturk, A.
Hochbaum, D. S.
32.
Using objective values to start multiple objective linear programming algorithms
European Journal of Operational Research
2001 : FEB 1, VOL. 128:3, p. 587-596
 2001 Arbel, A.
Korhonen, P.
33.
A derivative algorithm for inexact quadratic program- application to environmental decision-making under uncertainty
European Journal of Operational Research
2001 : FEB 1, VOL. 128:3, p. 570-586
 2001 Chen, M. J.
Huang, G. H.
34.
Stack-up algorithms for palletizing at delivery industry
European Journal of Operational Research
2001 : JAN 1, VOL. 128:1, p. 74-97
 2001 Rethmann, J.
Wanke, E.
35.
A pruning heuristic for use with multisource product design
European Journal of Operational Research
2001 : JAN 1, VOL. 128:1, p. 58-73
 2001 Tarasewich, P.
McMullen, P. R.
36.
Generation of efficient frontiers in multi-objective optimization problems by generalized data envelopment analysis
European Journal of Operational Research
2001 : MAR 16, VOL. 129:3, p. 586-595
 2001 Yun, Y. B.
37.
A GA-based fuzzy optimal model for construction time-cost trade-off
International Journal of Project Management
2001 : JAN, VOL. 19:1, p. 47-58
 2001 Leu, S.-S.
Chen, A.-T.
Yang, C.-H.
38.
An interior point method for solving systems of linear equations and inequalities
Operations research letters
2000 : VOL 27:3, p.101-107
 2000 Kallio, M.
Salo, S.
« edellinen sivu | seuraava sivu »
SCIMA