메뉴 건너뛰기




Volumn 18, Issue 3, 2000, Pages 235-253

Success Guarantee of Dual Search in Integer Programming: P-th Power Lagrangian Method

Author keywords

Dual search; Integer programming; Lagrangian method

Indexed keywords


EID: 0011055189     PISSN: 09255001     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1008325116400     Document Type: Article
Times cited : (30)

References (27)
  • 1
    • 0030921134 scopus 로고    scopus 로고
    • TRUST: A deterministic algorithm for global optimization
    • Barhen, J., Protopopescu, V. and Reister, D. (1997), TRUST: A deterministic algorithm for global optimization, Science 276: 1094-1097.
    • (1997) Science , vol.276 , pp. 1094-1097
    • Barhen, J.1    Protopopescu, V.2    Reister, D.3
  • 2
    • 0017490782 scopus 로고
    • A convergent duality theory for integer programming
    • Bell, D.E. and Shapiro, J.F. (1977), A convergent duality theory for integer programming, Operations Research 25: 419-434.
    • (1977) Operations Research , vol.25 , pp. 419-434
    • Bell, D.E.1    Shapiro, J.F.2
  • 3
    • 84915400984 scopus 로고
    • A survey of methods for pure nonlinear integer programming
    • Cooper, M.W. (1981), A survey of methods for pure nonlinear integer programming, Management Science 27: 353-361.
    • (1981) Management Science , vol.27 , pp. 353-361
    • Cooper, M.W.1
  • 4
    • 0000390120 scopus 로고
    • Taboo search: An approach to the multiple minima problem
    • Cvijović, D. and Klinowski, J. (1995), Taboo search: An approach to the multiple minima problem, Science 267: 664-666.
    • (1995) Science , vol.267 , pp. 664-666
    • Cvijović, D.1    Klinowski, J.2
  • 6
    • 0019477279 scopus 로고
    • The Lagrangian relaxation method for solving integer programming problems
    • Fisher, M.L. (1981), The Lagrangian relaxation method for solving integer programming problems, Management Science 27: 1-18.
    • (1981) Management Science , vol.27 , pp. 1-18
    • Fisher, M.L.1
  • 7
    • 33947605053 scopus 로고
    • Solving mixed integer nonlinear programs by outer approximation
    • Fletcher R. and Leyffer, S. (1994), Solving mixed integer nonlinear programs by outer approximation, Mathematical Programming 66: 327-349.
    • (1994) Mathematical Programming , vol.66 , pp. 327-349
    • Fletcher, R.1    Leyffer, S.2
  • 8
    • 0025385326 scopus 로고
    • A filled function method for finding a global minimizer of a function of several variables
    • Ge, R. (1990), A filled function method for finding a global minimizer of a function of several variables, Mathematical Programming 46: 191-204.
    • (1990) Mathematical Programming , vol.46 , pp. 191-204
    • Ge, R.1
  • 9
    • 0002554041 scopus 로고
    • Lagrangean relaxation for integer programming
    • Geoffrion, A.M. (1974), Lagrangean relaxation for integer programming, Mathematical Programming Study 2: 82-114.
    • (1974) Mathematical Programming Study , vol.2 , pp. 82-114
    • Geoffrion, A.M.1
  • 10
    • 0001215807 scopus 로고
    • Surrogate constraints
    • Glover, F. (1968), Surrogate constraints, Operations Research 16: 741-749.
    • (1968) Operations Research , vol.16 , pp. 741-749
    • Glover, F.1
  • 11
    • 0022208326 scopus 로고
    • Branch and bound experiments in convex nonlinear integer programming
    • Gupta, O.K. and Ravindran, A. (1985), Branch and bound experiments in convex nonlinear integer programming, Management Science 31: 1533-1546.
    • (1985) Management Science , vol.31 , pp. 1533-1546
    • Gupta, O.K.1    Ravindran, A.2
  • 13
    • 0018543663 scopus 로고
    • Some relationships between Lagrangian and surrogate duality in integer programming
    • Karwan, M.H. and Rardin, R.L. (1979), Some relationships between Lagrangian and surrogate duality in integer programming, Mathematical Programming 17: 320-334.
    • (1979) Mathematical Programming , vol.17 , pp. 320-334
    • Karwan, M.H.1    Rardin, R.L.2
  • 14
    • 0019054754 scopus 로고
    • Searchability of the composite and multiple surrogate dual functions
    • Karwan, M.H. and Rardin, R.L. (1980), Searchability of the composite and multiple surrogate dual functions, Operations Research 28: 1251-1257.
    • (1980) Operations Research , vol.28 , pp. 1251-1257
    • Karwan, M.H.1    Rardin, R.L.2
  • 15
    • 0002175846 scopus 로고
    • Optimal pacing of trains in freight railroads-model formulation and solution
    • Kraay, D., Harker, P.T. and Chen, B.T. (1991), Optimal pacing of trains in freight railroads-model formulation and solution, Operations Research 39: 82-99.
    • (1991) Operations Research , vol.39 , pp. 82-99
    • Kraay, D.1    Harker, P.T.2    Chen, B.T.3
  • 16
    • 21844506739 scopus 로고
    • Zero duality gap for a class of nonconvex optimization problems
    • Li, D. (1995), Zero duality gap for a class of nonconvex optimization problems, J. of Optimization Theory and Applications 85: 309-324.
    • (1995) J. Of Optimization Theory and Applications , vol.85 , pp. 309-324
    • Li, D.1
  • 17
    • 0032659908 scopus 로고    scopus 로고
    • Zero duality gap in integer programming: P-norm surrogate constraint method
    • Li, D. (1999), Zero duality gap in integer programming: P-norm surrogate constraint method, Operations Research Letters 25: 89-96.
    • (1999) Operations Research Letters , vol.25 , pp. 89-96
    • Li, D.1
  • 18
    • 34249921509 scopus 로고
    • Lagrangean decomposition for integer nonlinear programming with linear constraints
    • Michelon, P. and Maculan, N. (1991), Lagrangean decomposition for integer nonlinear programming with linear constraints, Mathematical Programming 52: 303-313.
    • (1991) Mathematical Programming , vol.52 , pp. 303-313
    • Michelon, P.1    Maculan, N.2
  • 19
    • 0346101919 scopus 로고
    • Smart greedy procedure for solving a nonlinear knapsack class of reliability optimization problems
    • Ohtagaki, H., Nakagawa, Y., Iwasaki, A. and Narihisa, H. (1995), Smart greedy procedure for solving a nonlinear knapsack class of reliability optimization problems, Mathematical and Computer Modelling 22: 261-272.
    • (1995) Mathematical and Computer Modelling , vol.22 , pp. 261-272
    • Ohtagaki, H.1    Nakagawa, Y.2    Iwasaki, A.3    Narihisa, H.4
  • 21
    • 0023420912 scopus 로고
    • Stochastic global optimization methods, Part I: Clustering method
    • Rinnoy Kan, A.H.G. and Timmer, G.T. (1987a), Stochastic global optimization methods, Part I: Clustering method, Mathematical Programming 39: 27-56.
    • (1987) Mathematical Programming , vol.39 , pp. 27-56
    • Rinnoy Kan, A.H.G.1    Timmer, G.T.2
  • 22
    • 0023419959 scopus 로고
    • Stochastic global optimization methods, Part II: Multi-level method
    • Rinnoy Kan, A.H.G. and Timmer, G. T. (1987b), Stochastic global optimization methods, Part II: Multi-level method, Mathematical Programming 39: 57-78.
    • (1987) Mathematical Programming , vol.39 , pp. 57-78
    • Rinnoy Kan, A.H.G.1    Timmer, G.T.2
  • 23
    • 0000834192 scopus 로고
    • A survey of Lagrangian techniques for discrete optimization
    • Shapiro, J.F. (1979), A survey of Lagrangian techniques for discrete optimization, Annals of Discrete Mathematics 5: 113-138.
    • (1979) Annals of Discrete Mathematics , vol.5 , pp. 113-138
    • Shapiro, J.F.1
  • 24
    • 0023598770 scopus 로고
    • Non-linear integer programming: Sensitivity analysis for branch and bound
    • Skorin-Kapov, J. and Granot, F. (1987), Non-linear integer programming: sensitivity analysis for branch and bound, Operations Research Letters 6: 269-274.
    • (1987) Operations Research Letters , vol.6 , pp. 269-274
    • Skorin-Kapov, J.1    Granot, F.2
  • 25
    • 0032671730 scopus 로고    scopus 로고
    • Branch-and-bound redundancy optimization for a series system with multiple-choice constraints
    • Sung, C.S. and Cho, Y.K. (1999), Branch-and-bound redundancy optimization for a series system with multiple-choice constraints, IEEE Transactions on Reliability 48: 108-117.
    • (1999) IEEE Transactions on Reliability , vol.48 , pp. 108-117
    • Sung, C.S.1    Cho, Y.K.2
  • 27
    • 0019004150 scopus 로고
    • Optimization of system reliability: A survey of problems and techniques
    • Tzafestas, S.G. (1980), Optimization of system reliability: A survey of problems and techniques, International J. of Systems Science 11: 455-486.
    • (1980) International J. Of Systems Science , vol.11 , pp. 455-486
    • Tzafestas, S.G.1


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