메뉴 건너뛰기




Volumn 17, Issue 1, 2002, Pages 1-29

Survey of bundle methods for nonsmooth optimization

Author keywords

Bundle methods; Nondifferentiable programming; Nonsmooth optimization

Indexed keywords

CONSTRAINT THEORY; ECONOMICS; MECHANICS; NUMERICAL ANALYSIS; OPTIMAL CONTROL SYSTEMS;

EID: 0036462808     PISSN: 10556788     EISSN: None     Source Type: Journal    
DOI: 10.1080/10556780290027828     Document Type: Article
Times cited : (150)

References (88)
  • 2
    • 0003777056 scopus 로고
    • J.J. Moreau, P.D. Panagiotopoulos and G. Strang (Eds.); Birkhäuser Verlag, Basel
    • J.J. Moreau, P.D. Panagiotopoulos and G. Strang (Eds.) (1988). Topics in Nonsmooth Mechanics. Birkhäuser Verlag, Basel.
    • (1988) Topics in Nonsmooth Mechanics
  • 6
    • 77957820648 scopus 로고
    • Nondifferentiable optimization
    • In: G.L. Nemhauser, A.H.G. Rinnooy Kan and M.J. Todd (Eds.); North-Holland, Amsterdam
    • C. Lemaréchal (1989). Nondifferentiable Optimization. In: G.L. Nemhauser, A.H.G. Rinnooy Kan and M.J. Todd (Eds.), Optimization, pp. 529-572. North-Holland, Amsterdam.
    • (1989) Optimization , pp. 529-572
    • Lemaréchal, C.1
  • 10
    • 0005090898 scopus 로고
    • On constrained optimization problems with nonsmooth cost functionals
    • K.L. Teo and C.J. Goh (1988). On constrained optimization problems with nonsmooth cost functionals. Applied Mathematics and Optimization, 18, 181-190.
    • (1988) Applied Mathematics and Optimization , vol.18 , pp. 181-190
    • Teo, K.L.1    Goh, C.J.2
  • 13
    • 0026254320 scopus 로고
    • New variable metric algorithms for nondifferentiable optimization problems
    • S.P. Uryas'ev (1991). New variable metric algorithms for nondifferentiable optimization problems. Journal of Optimization Theory and Application, 71, 359-388.
    • (1991) Journal of Optimization Theory and Application , vol.71 , pp. 359-388
    • Uryas'ev, S.P.1
  • 14
    • 0004267646 scopus 로고
    • Princeton University Press, Princeton, New Jersey
    • R.T. Rockafellar (1970). Convex Analysis. Princeton University Press, Princeton, New Jersey.
    • (1970) Convex Analysis
    • Rockafellar, R.T.1
  • 16
    • 0000882113 scopus 로고
    • Newton's method for convex programming and tchebycheff approximation
    • E.W. Cheney and A.A. Goldstein (1959). Newton's method for convex programming and Tchebycheff approximation. Numerische Mathematik, 1, 253-268.
    • (1959) Numerische Mathematik , vol.1 , pp. 253-268
    • Cheney, E.W.1    Goldstein, A.A.2
  • 17
    • 0001547779 scopus 로고
    • The cutting plane method for solving convex programs
    • J.E. Kelley (1960). The cutting plane method for solving convex programs. SIAM J., 8, 703-712.
    • (1960) SIAM J. , vol.8 , pp. 703-712
    • Kelley, J.E.1
  • 18
    • 0016621235 scopus 로고
    • A method of conjugate subgradients for minimizing nondifferentiable functions
    • P. Wolfe (1975). A method of conjugate subgradients for minimizing nondifferentiable functions. Mathematical Programming Study, 3, 145-173.
    • (1975) Mathematical Programming Study , vol.3 , pp. 145-173
    • Wolfe, P.1
  • 20
    • 0016597848 scopus 로고
    • An extension of Davidon methods to non differentiable problems
    • C. Lemaréchal (1975). An Extension of Davidon methods to non differentiable problems. Mathematical Programming Study, 3, 95-109.
    • (1975) Mathematical Programming Study , vol.3 , pp. 95-109
    • Lemaréchal, C.1
  • 21
    • 0000009213 scopus 로고
    • An algorithm for constrained optimization with semismooth functions
    • R. Mifflin (1977). An algorithm for constrained optimization with semismooth functions. Mathematics of Operations Research, 2, 191-207.
    • (1977) Mathematics of Operations Research , vol.2 , pp. 191-207
    • Mifflin, R.1
  • 22
    • 0020718891 scopus 로고
    • On the extension of constrained optimization algorithms from differentiable to nondifferentiable problems
    • E. Polak, D.Q. Mayne and Y. Wardi (1983). On the extension of constrained optimization algorithms from differentiable to nondifferentiable problems. SIAM Journal on Optimal Control and Optimization, 21, 179-203.
    • (1983) SIAM Journal on Optimal Control and Optimization , vol.21 , pp. 179-203
    • Polak, E.1    Mayne, D.Q.2    Wardi, Y.3
  • 23
    • 0002396293 scopus 로고
    • On the convergence rates of subgradient optimization methods
    • J.L. Goffin (1977). On the convergence rates of subgradient optimization methods. Mathematical Programming, 13, 329-347.
    • (1977) Mathematical Programming , vol.13 , pp. 329-347
    • Goffin, J.L.1
  • 24
    • 0001773704 scopus 로고
    • Numerical experiments in nonsmooth optimization
    • In: E.A. Nurminski (Ed.); IIASA-report, Laxemburg, Austria
    • C. Lemaréchal (1982). Numerical experiments in nonsmooth optimization. In: E.A. Nurminski (Ed.), Progress in Nondifferentiable Optimization, pp. 61-84. IIASA-report, Laxemburg, Austria.
    • (1982) Progress in Nondifferentiable Optimization , pp. 61-84
    • Lemaréchal, C.1
  • 26
    • 0000851851 scopus 로고
    • On a bundle algorithm for nonsmooth optimization
    • In: O.L. Mangasarian, R.R. Mayer and S.M. Robinson, (Eds.); Academic Press, New York
    • C. Lemaréchal, J.-J. Strodiot and A. Bihain (1981). On a bundle algorithm for nonsmooth optimization. In: O.L. Mangasarian, R.R. Mayer and S.M. Robinson, (Eds.), Nonlinear Programming, pp. 245-281. Academic Press, New York.
    • (1981) Nonlinear Programming , pp. 245-281
    • Lemaréchal, C.1    Strodiot, J.-J.2    Bihain, A.3
  • 27
    • 0020736489 scopus 로고
    • ε-Optimal solutions in nondifferentiable convex programming and some related questions
    • J.-J. Strodiot, V.H. Nguyen and N. Heukemes (1983). ε-Optimal solutions in nondifferentiable convex programming and some related questions. Mathematical Programming, 25, 307-328.
    • (1983) Mathematical Programming , vol.25 , pp. 307-328
    • Strodiot, J.-J.1    Nguyen, V.H.2    Heukemes, N.3
  • 32
    • 0020702681 scopus 로고
    • Numerical methods for nondifferentiable convex optimization
    • A. Auslender (1987). Numerical methods for nondifferentiable convex optimization. Mathematical Programming Study, 30, 102-126.
    • (1987) Mathematical Programming Study , vol.30 , pp. 102-126
    • Auslender, A.1
  • 33
    • 0025208765 scopus 로고
    • Proximity control in bundle methods for convex nondifferentiable optimization
    • K.C. Kiwiel (1990). Proximity control in bundle methods for convex nondifferentiable optimization. Mathematical Programming, 46, 105-122.
    • (1990) Mathematical Programming , vol.46 , pp. 105-122
    • Kiwiel, K.C.1
  • 34
    • 0000091855 scopus 로고
    • A version of the bundle idea for minimizing a nonsmooth functions: Conceptual idea, convergence analysis, numerical results
    • H. Schramm and J. Zowe (1992). A version of the bundle idea for minimizing a nonsmooth functions: conceptual idea, convergence analysis, numerical results. SIAM Journal on Optimization, 2, 121-152.
    • (1992) SIAM Journal on Optimization , vol.2 , pp. 121-152
    • Schramm, H.1    Zowe, J.2
  • 35
    • 0000873069 scopus 로고
    • A method for the solution of certain nonlinear problems in least squares
    • K. Levenberg (1944). A method for the solution of certain nonlinear problems in least squares. Quart. Appl. Math., 2, 164-166.
    • (1944) Quart. Appl. Math. , vol.2 , pp. 164-166
    • Levenberg, K.1
  • 36
    • 0000169232 scopus 로고
    • An algorithm for least-squares estimation of nonlinear parameters
    • D.W. Marquardt (1963). An algorithm for least-squares estimation of nonlinear parameters. SIAM Journal on Applied Mathematics, 11, 431-441.
    • (1963) SIAM Journal on Applied Mathematics , vol.11 , pp. 431-441
    • Marquardt, D.W.1
  • 37
    • 0000525522 scopus 로고
    • An approach to variable metric bundle methods
    • In: J. Henry and J.P. Yvon (Eds.); Springer-Verlag, New York
    • C. Lemaréchal and C. Sagastizábal (1994). An approach to variable metric bundle methods. In: J. Henry and J.P. Yvon (Eds.), Lecture Notes in Control and Information Sciences, Vol. 197, pp. 144-162. Springer-Verlag, New York.
    • (1994) Lecture Notes in Control and Information Sciences , vol.197 , pp. 144-162
    • Lemaréchal, C.1    Sagastizábal, C.2
  • 38
    • 0000275440 scopus 로고    scopus 로고
    • Variable metric bundle methods: From conceptual to implementable forms
    • C. Lemaréchal and C. Sagastizábal (1997). Variable metric bundle methods: from conceptual to implementable forms. Mathematical Programming, 76, 393-410.
    • (1997) Mathematical Programming , vol.76 , pp. 393-410
    • Lemaréchal, C.1    Sagastizábal, C.2
  • 39
    • 0032376260 scopus 로고    scopus 로고
    • Convergence analysis of some methods for minimizing a nonsmooth convex function
    • J.R. Birge, L. Qi and Z. Wei (1998). Convergence analysis of some methods for minimizing a nonsmooth convex function. Journal of Optimization Theory and Applications, 97, 357-383.
    • (1998) Journal of Optimization Theory and Applications , vol.97 , pp. 357-383
    • Birge, J.R.1    Qi, L.2    Wei, Z.3
  • 42
    • 0040165092 scopus 로고    scopus 로고
    • Practical aspects of the moreu-yosida regularization: Theoretical preliminaries
    • C. Lemaréchal and C. Sagastizábal (1997). Practical aspects of the Moreu-Yosida regularization: theoretical preliminaries. SIAM Journal on Optimization, 7, 367-385.
    • (1997) SIAM Journal on Optimization , vol.7 , pp. 367-385
    • Lemaréchal, C.1    Sagastizábal, C.2
  • 44
    • 0000813954 scopus 로고    scopus 로고
    • A bundle bregman proximal method for convex nondifferentiable minimization
    • K.C. Kiwiel (1999). A bundle Bregman proximal method for convex nondifferentiable minimization. Mathematical Programming, 85, 241-258.
    • (1999) Mathematical Programming , vol.85 , pp. 241-258
    • Kiwiel, K.C.1
  • 45
    • 0031190440 scopus 로고    scopus 로고
    • Proximal minimization methods with generalized bregman functions
    • K.C. Kiwiel (1997). Proximal minimization methods with generalized Bregman functions. SIAM Journal on Optimal Control and Optimization 35, 1142-1168.
    • (1997) SIAM Journal on Optimal Control and Optimization , vol.35 , pp. 1142-1168
    • Kiwiel, K.C.1
  • 46
    • 0039928944 scopus 로고    scopus 로고
    • Generalized hessian properties of regularized nonsmooth functions
    • R.A. Poliquin and R.T. Rockafellar (1996). Generalized Hessian properties of regularized nonsmooth functions. SIAM Journal on Optimization, 6, 1121-1137.
    • (1996) SIAM Journal on Optimization , vol.6 , pp. 1121-1137
    • Poliquin, R.A.1    Rockafellar, R.T.2
  • 47
    • 0005037054 scopus 로고
    • Variants to the cutting plane approach for convex nondifferentiable optimization
    • M. Gaudiso and M. F. Monaco (1992). Variants to the cutting plane approach for convex nondifferentiable optimization. Optimization, 25, 65-75.
    • (1992) Optimization , vol.25 , pp. 65-75
    • Gaudiso, M.1    Monaco, M.F.2
  • 49
    • 0001844687 scopus 로고    scopus 로고
    • A quasi-second-order proximal bundle algorithm
    • R. Mifflin (1996). A quasi-second-order proximal bundle algorithm. Mathematical Programming, 73, 51-72.
    • (1996) Mathematical Programming , vol.73 , pp. 51-72
    • Mifflin, R.1
  • 50
    • 0001106044 scopus 로고    scopus 로고
    • Proximal quasi-newton methods for nondifferentiable convex optimization
    • X. Chen and M. Fukushima (1995). Proximal quasi-Newton methods for nondifferentiable convex optimization. Mathematical Programming, 85, 313-334.
    • (1999) Mathematical Programming , vol.85 , pp. 313-334
    • Chen, X.1    Fukushima, M.2
  • 51
    • 0005041776 scopus 로고    scopus 로고
    • On the super-linear convergence of the variable metric proximal point algorithm using broyden and BFGS matrix secant updating
    • J.V. Burke and M. Qian (2000). On the super-linear convergence of the variable metric proximal point algorithm using Broyden and BFGS matrix secant updating. Mathematical Programming, 88, 157-181.
    • (2000) Mathematical Programming , vol.88 , pp. 157-181
    • Burke, J.V.1    Qian, M.2
  • 52
    • 0033245906 scopus 로고    scopus 로고
    • Globally convergent variable metric method for convex nonsmooth unconstrained minimization
    • L. Lukšan and J. Vlček (1999). Globally convergent variable metric method for convex nonsmooth unconstrained minimization. Journal of Optimization Theory and Applications, 102, 593-613.
    • (1999) Journal of Optimization Theory and Applications , vol.102 , pp. 593-613
    • Lukšan, L.1    Vlček, J.2
  • 53
    • 0003108675 scopus 로고
    • A modification and an extension of Lemaréchal's algorithm for nonsmooth minimization
    • R. Mifflin (1982). A Modification and an extension of Lemaréchal's algorithm for nonsmooth minimization. Mathematical Programming Study, 17, 77-90.
    • (1982) Mathematical Programming Study , vol.17 , pp. 77-90
    • Mifflin, R.1
  • 54
    • 34250235450 scopus 로고
    • A bundle type approach to the unconstrained minimization of convex nonsmooth functions
    • M. Gaudioso and M.F. Monaco (1982). A bundle type approach to the unconstrained minimization of convex nonsmooth functions. Mathematical Programming, 23, 216-226.
    • (1982) Mathematical Programming , vol.23 , pp. 216-226
    • Gaudioso, M.1    Monaco, M.F.2
  • 55
    • 0005037969 scopus 로고
    • A modification of the cutting-plane method with accelerated convergence
    • In: V.F. Demyanov and D. Pallaschke (Eds.); Springer-Verlag, Berlin
    • V.N. Tarasov and N.K. Popva (1984). A modification of the cutting-plane method with accelerated convergence. In: V.F. Demyanov and D. Pallaschke (Eds.), Nondifferentiable Optimization: Motivations and Applications, pp. 284-290. Springer-Verlag, Berlin.
    • (1984) Nondifferentiable Optimization: Motivations and Applications , pp. 284-290
    • Tarasov, V.N.1    Popva, N.K.2
  • 56
    • 0002049726 scopus 로고
    • A tilted cutting plane proximal bundle method for convex nondifferentiable optimization
    • K.C. Kiwiel (1991). A tilted cutting plane proximal bundle method for convex nondifferentiable optimization. Operations Research Letters, 10, 75-81.
    • (1991) Operations Research Letters , vol.10 , pp. 75-81
    • Kiwiel, K.C.1
  • 59
    • 21844511941 scopus 로고
    • A descent method with relaxation type step
    • In: J. Henry and J.P. Yvon (Eds.); Springer-Verlag, New York
    • U. Brännlund (1994). A descent method with relaxation type step. In: J. Henry and J.P. Yvon (Eds.), Lecture Notes in Control and Information Sciences, Vol. 197. pp. 177-186. Springer-Verlag, New York.
    • (1994) Lecture Notes in Control and Information Sciences , vol.197 , pp. 177-186
    • Brännlund, U.1
  • 60
    • 0029336239 scopus 로고
    • Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities
    • K.C. Kiwiel (1995). Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities. Mathematical Programming, 69, 89-109.
    • (1995) Mathematical Programming , vol.69 , pp. 89-109
    • Kiwiel, K.C.1
  • 61
    • 0029290912 scopus 로고
    • A descent proximal level bundle method for convex nondifferentiable optimization
    • U. Brännlund, K.C. Kiwiel and P.O. Lindberg (1995). A descent proximal level bundle method for convex nondifferentiable optimization. Operations Research Letters, 17, 121-126.
    • (1995) Operations Research Letters , vol.17 , pp. 121-126
    • Brännlund, U.1    Kiwiel, K.C.2    Lindberg, P.O.3
  • 62
    • 0005102253 scopus 로고    scopus 로고
    • Preliminary computational experience with a descent level method for convex nondifferentiable optimization
    • In: J. Doležal and J. Fidler (Eds.); Chapman and Hall, London
    • U. Brännlund, K.C. Kiwiel and P.O. Lindberg (1996). Preliminary computational experience with a descent level method for convex nondifferentiable optimization. In: J. Doležal and J. Fidler (Eds.), System Modelling and Optimization, pp. 387-394. Chapman and Hall, London.
    • (1996) System Modelling and Optimization , pp. 387-394
    • Brännlund, U.1    Kiwiel, K.C.2    Lindberg, P.O.3
  • 63
    • 0002450587 scopus 로고    scopus 로고
    • A bundle-newton method for nonsmooth unconstrained minimization
    • L. Lukšan and J. Vlček (1998). A bundle-Newton method for nonsmooth unconstrained minimization. Mathematical Programming, 83, 373-391.
    • (1998) Mathematical Programming , vol.83 , pp. 373-391
    • Lukšan, L.1    Vlček, J.2
  • 64
    • 0001525323 scopus 로고    scopus 로고
    • Comparing nonsmooth nonconvex bundle methods in solving hemivariational inequalities
    • M.M. Mäkelä, M. Miettinen, L. Lukšan and J. Vlček (1999). Comparing nonsmooth nonconvex bundle methods in solving hemivariational inequalities. Journal of Global Optimization, 14, 117-135.
    • (1999) Journal of Global Optimization , vol.14 , pp. 117-135
    • Mäkelä, M.M.1    Miettinen, M.2    Lukšan, L.3    Vlček, J.4
  • 65
    • 84966250609 scopus 로고
    • An algorithm for nonsmooth convex minimization with errors
    • K.C. Kiwiel (1985). An algorithm for nonsmooth convex minimization with errors. Mathematics of Computation, 45, 173-180.
    • (1985) Mathematics of Computation , vol.45 , pp. 173-180
    • Kiwiel, K.C.1
  • 66
    • 0005071104 scopus 로고
    • Approximations in decomposition of large-scale convex programs via a nondifferentiable optimization method
    • In: Ü. Jaaksoo and V.I. Utkin (Eds.); Pergamon Press, Oxford
    • K.C. Kiwiel (1991). Approximations in decomposition of large-scale convex programs via a nondifferentiable optimization method. In: Ü. Jaaksoo and V.I. Utkin (Eds.), Proceedings of the 11th Triennal IFAC World Congress. pp. 161-166. Pergamon Press, Oxford.
    • (1991) Proceedings of the 11th Triennal IFAC World Congress , pp. 161-166
    • Kiwiel, K.C.1
  • 67
    • 21844495838 scopus 로고
    • Approximations in proximal bundle methods and decomposition of convex programs
    • K.C. Kiwiel (1995). Approximations in proximal bundle methods and decomposition of convex programs. Journal of Optimization Theory and Applications, 84, 529-548.
    • (1995) Journal of Optimization Theory and Applications , vol.84 , pp. 529-548
    • Kiwiel, K.C.1
  • 73
    • 0030304777 scopus 로고    scopus 로고
    • Restricted step and levenberg-marquardt techniques in proximal bundle methods for nonconvex nondifferentiable optimization
    • K.C. Kiwiel (1996). Restricted step and Levenberg-Marquardt techniques in proximal bundle methods for nonconvex nondifferentiable optimization. SIAM Journal on Optimization, 6, 227-249.
    • (1996) SIAM Journal on Optimization , vol.6 , pp. 227-249
    • Kiwiel, K.C.1
  • 75
    • 0022678357 scopus 로고
    • A method of linearizations for linearly constrained nonconvex nonsmooth minimization
    • K.C. Kiwiel (1986). A method of linearizations for linearly constrained nonconvex nonsmooth minimization. Mathematical Programming, 34, 175-187.
    • (1986) Mathematical Programming , vol.34 , pp. 175-187
    • Kiwiel, K.C.1
  • 77
    • 0000135467 scopus 로고
    • An exact penalty function method for nonsmooth constrained convex minimization problems
    • K.C. Kiwiel (1985). An exact penalty function method for nonsmooth constrained convex minimization problems. IMA Journal of Numerical Analysis, 5, 111-119.
    • (1985) IMA Journal of Numerical Analysis , vol.5 , pp. 111-119
    • Kiwiel, K.C.1
  • 78
    • 0000695140 scopus 로고
    • A constraint linearization method for nondifferentiable convex minimization
    • K.C. Kiwiel (1987). A constraint linearization method for nondifferentiable convex minimization. Numerische Mathematik, 51, 395-414.
    • (1987) Numerische Mathematik , vol.51 , pp. 395-414
    • Kiwiel, K.C.1
  • 79
    • 34249923238 scopus 로고
    • Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
    • K.C. Kiwiel (1991). Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization. Mathematical Programming, 52, 285-302.
    • (1991) Mathematical Programming , vol.52 , pp. 285-302
    • Kiwiel, K.C.1
  • 83
    • 0000135023 scopus 로고
    • Interactive bundle-based method for nondifferentiable multiobjective optimization: NIMBUS
    • K. Miettinen and M.M. Mäkelä (1995). Interactive bundle-based method for nondifferentiable multiobjective optimization: NIMBUS. Optimization, 34, 231-246.
    • (1995) Optimization , vol.34 , pp. 231-246
    • Miettinen, K.1    Mäkelä, M.M.2
  • 84
    • 0022042986 scopus 로고
    • A descent method for nonsmooth convex multiobjective minimization
    • K.C. Kiwiel (1985). A descent method for nonsmooth convex multiobjective minimization. Large Scale Systems, 8, 119-129.
    • (1985) Large Scale Systems , vol.8 , pp. 119-129
    • Kiwiel, K.C.1
  • 85
    • 0005101445 scopus 로고
    • Algorithms for multiobjective and nonsmooth optimization
    • In: P. Kleinschmidt, F.J. Radermacher, W. Schweitzer and H. Wildermann (Eds.); Athenäum Verlag, Frankfurt am Main
    • S. Wang (1989). Algorithms for multiobjective and nonsmooth optimization. In: P. Kleinschmidt, F.J. Radermacher, W. Schweitzer and H. Wildermann (Eds.), Methods of Operations Research, Vol. 58, pp. 131-142. Athenäum Verlag, Frankfurt am Main.
    • (1989) Methods of Operations Research , vol.58 , pp. 131-142
    • Wang, S.1
  • 86
    • 0019007090 scopus 로고
    • Algorithms for multicriterion optimization
    • H. Mukai (1980). Algorithms for multicriterion optimization. IEEE Transactions on Automatic Control, ac-25, 177-186.
    • (1980) IEEE Transactions on Automatic Control , vol.ac-25 , pp. 177-186
    • Mukai, H.1
  • 87
    • 0343618700 scopus 로고    scopus 로고
    • Interactive multiobjective optimization system WWW-NIMBUS on the internet
    • K. Miettinen and M.M. Mäkelä (2000). Interactive multiobjective optimization system WWW-NIMBUS on the internet. Computers and Operations Research, 27, 709-723.
    • (2000) Computers and Operations Research , vol.27 , pp. 709-723
    • Miettinen, K.1    Mäkelä, M.M.2
  • 88
    • 0344211083 scopus 로고    scopus 로고
    • Comparative evaluation of some interactive reference point-based methods for multi-objective optimisation
    • K. Miettinen and M.M. Mäkelä (1999). Comparative evaluation of some interactive reference point-based methods for multi-objective optimisation. Journal of the Operational Research Society, 50, 949-959.
    • (1999) Journal of the Operational Research Society , vol.50 , pp. 949-959
    • Miettinen, K.1    Mäkelä, M.M.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.