{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T14:23:00Z","timestamp":1770474180783,"version":"3.49.0"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2000,11,1]],"date-time":"2000-11-01T00:00:00Z","timestamp":973036800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,11,1]],"date-time":"2000-11-01T00:00:00Z","timestamp":973036800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Global Optimization"],"published-print":{"date-parts":[[2000,11]]},"DOI":"10.1023\/a:1008325116400","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T14:41:38Z","timestamp":1040568098000},"page":"235-253","source":"Crossref","is-referenced-by-count":22,"title":["Success Guarantee of Dual Search in Integer Programming: p-th Power Lagrangian Method"],"prefix":"10.1007","volume":"18","author":[{"given":"D.","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"X. L.","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"268603_CR1","doi-asserted-by":"crossref","first-page":"1094","DOI":"10.1126\/science.276.5315.1094","volume":"276","author":"J. Barhen","year":"1997","unstructured":"Barhen, J., Protopopescu, V. and Reister, D. (1997), TRUST: A deterministic algorithm for global optimization, Science 276: 1094-1097.","journal-title":"Science"},{"key":"268603_CR2","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1287\/opre.25.3.419","volume":"25","author":"D.E. Bell","year":"1977","unstructured":"Bell, D.E. and Shapiro, J.F. (1977), A convergent duality theory for integer programming, Operations Research 25: 419-434.","journal-title":"Operations Research"},{"key":"268603_CR3","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1287\/mnsc.27.3.353","volume":"27","author":"M.W. Cooper","year":"1981","unstructured":"Cooper, M.W. (1981), A survey of methods for pure nonlinear integer programming, Management Science 27: 353-361.","journal-title":"Management Science"},{"key":"268603_CR4","doi-asserted-by":"crossref","first-page":"664","DOI":"10.1126\/science.267.5198.664","volume":"267","author":"D. Cvijovi\u0107","year":"1995","unstructured":"Cvijovi\u0107, D. and Klinowski, J. (1995), Taboo search: An approach to the multiple minima problem, Science 267: 664-666.","journal-title":"Science"},{"key":"268603_CR5","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1137\/0127003","volume":"27","author":"M.L. Fisher","year":"1974","unstructured":"Fisher, M.L. and Shapiro, J.F. (1974), Constructive duality in integer programming, SIAM Journal on Applied Mathematics 27: 31-52.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"268603_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","volume":"27","author":"M.L. Fisher","year":"1981","unstructured":"Fisher, M.L. (1981), The Lagrangian relaxation method for solving integer programming problems, Management Science 27: 1-18.","journal-title":"Management Science"},{"key":"268603_CR7","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BF01581153","volume":"66","author":"R. Fletcher","year":"1994","unstructured":"Fletcher R. and Leyffer, S. (1994), Solving mixed integer nonlinear programs by outer approximation, Mathematical Programming 66: 327-349.","journal-title":"Mathematical Programming"},{"key":"268603_CR8","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF01585737","volume":"46","author":"R. Ge","year":"1990","unstructured":"Ge, R. (1990), A filled function method for finding a global minimizer of a function of several variables, Mathematical Programming 46: 191-204.","journal-title":"Mathematical Programming"},{"key":"268603_CR9","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","volume":"2","author":"A.M. Geoffrion","year":"1974","unstructured":"Geoffrion, A.M. (1974), Lagrangean relaxation for integer programming, Mathematical Programming Study 2: 82-114.","journal-title":"Mathematical Programming Study"},{"key":"268603_CR10","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1287\/opre.16.4.741","volume":"16","author":"F. Glover","year":"1968","unstructured":"Glover, F. (1968), Surrogate constraints, Operations Research 16: 741-749.","journal-title":"Operations Research"},{"key":"268603_CR11","doi-asserted-by":"crossref","first-page":"1533","DOI":"10.1287\/mnsc.31.12.1533","volume":"31","author":"O.K. Gupta","year":"1985","unstructured":"Gupta, O.K. and Ravindran, A. (1985), Branch and bound experiments in convex nonlinear integer programming, Management Science 31: 1533-1546.","journal-title":"Management Science"},{"key":"268603_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02947-3","volume-title":"Global Optimization: Deterministic Approaches","author":"R. Horst","year":"1993","unstructured":"Horst, R. and Tuy, H. (1993), Global Optimization: Deterministic Approaches, Springer-Verlag, Berlin."},{"key":"268603_CR13","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1007\/BF01588253","volume":"17","author":"M.H. Karwan","year":"1979","unstructured":"Karwan, M.H. and Rardin, R.L. (1979), Some relationships between Lagrangian and surrogate duality in integer programming, Mathematical Programming 17: 320-334.","journal-title":"Mathematical Programming"},{"key":"268603_CR14","doi-asserted-by":"crossref","first-page":"1251","DOI":"10.1287\/opre.28.5.1251","volume":"28","author":"M.H. Karwan","year":"1980","unstructured":"Karwan, M.H. and Rardin, R.L. (1980), Searchability of the composite and multiple surrogate dual functions, Operations Research 28: 1251-1257.","journal-title":"Operations Research"},{"key":"268603_CR15","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1287\/opre.39.1.82","volume":"39","author":"D. Kraay","year":"1991","unstructured":"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.","journal-title":"Operations Research"},{"key":"268603_CR16","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/BF02192229","volume":"85","author":"D. Li","year":"1995","unstructured":"Li, D. (1995), Zero duality gap for a class of nonconvex optimization problems, J. of Optimization Theory and Applications 85: 309-324.","journal-title":"J. of Optimization Theory and Applications"},{"key":"268603_CR17","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/S0167-6377(99)00039-5","volume":"25","author":"D. Li","year":"1999","unstructured":"Li, D. (1999), Zero duality gap in integer programming: P-norm surrogate constraint method, Operations Research Letters 25: 89-96.","journal-title":"Operations Research Letters"},{"key":"268603_CR18","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF01582893","volume":"52","author":"P. Michelon","year":"1991","unstructured":"Michelon, P. and Maculan, N. (1991), Lagrangean decomposition for integer nonlinear programming with linear constraints, Mathematical Programming 52: 303-313.","journal-title":"Mathematical Programming"},{"key":"268603_CR19","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0895-7177(95)00203-E","volume":"22","author":"H. Ohtagaki","year":"1995","unstructured":"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.","journal-title":"Mathematical and Computer Modelling"},{"key":"268603_CR20","volume-title":"Discrete Optimization","author":"R.G. Parker","year":"1988","unstructured":"Parker, R.G. and Rardin, R.L. (1988), Discrete Optimization, Academic, Boston."},{"key":"268603_CR21","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF02592070","volume":"39","author":"A.H.G. Rinnoy Kan","year":"1987","unstructured":"Rinnoy Kan, A.H.G. and Timmer, G.T. (1987a), Stochastic global optimization methods, Part I: Clustering method, Mathematical Programming 39: 27-56.","journal-title":"Mathematical Programming"},{"key":"268603_CR22","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF02592071","volume":"39","author":"A.H.G. Rinnoy Kan","year":"1987","unstructured":"Rinnoy Kan, A.H.G. and Timmer, G. T. (1987b), Stochastic global optimization methods, Part II: Multi-level method, Mathematical Programming 39: 57-78.","journal-title":"Mathematical Programming"},{"key":"268603_CR23","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0167-5060(08)70346-7","volume":"5","author":"J.F. Shapiro","year":"1979","unstructured":"Shapiro, J.F. (1979), A survey of Lagrangian techniques for discrete optimization, Annals of Discrete Mathematics 5: 113-138.","journal-title":"Annals of Discrete Mathematics"},{"key":"268603_CR24","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0167-6377(87)90041-1","volume":"6","author":"J. Skorin-Kapov","year":"1987","unstructured":"Skorin-Kapov, J. and Granot, F. (1987), Non-linear integer programming: sensitivity analysis for branch and bound, Operations Research Letters 6: 269-274.","journal-title":"Operations Research Letters"},{"key":"268603_CR25","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1109\/24.784268","volume":"48","author":"C.S. Sung","year":"1999","unstructured":"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.","journal-title":"IEEE Transactions on Reliability"},{"key":"268603_CR26","unstructured":"Tillman, F.A., Hwuang, C.L. and Kuo, W. (1980), Optimization of System Reliability, Marcel Dekker."},{"key":"268603_CR27","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1080\/00207728008967030","volume":"11","author":"S.G. Tzafestas","year":"1980","unstructured":"Tzafestas, S.G. (1980), Optimization of system reliability: A survey of problems and techniques, International J. of Systems Science 11: 455-486.","journal-title":"International J. of Systems Science"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008325116400.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008325116400\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008325116400.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T10:47:03Z","timestamp":1751366823000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008325116400"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,11]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2000,11]]}},"alternative-id":["268603"],"URL":"https:\/\/doi.org\/10.1023\/a:1008325116400","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,11]]}}}