{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T14:11:18Z","timestamp":1680444678384},"reference-count":17,"publisher":"Elsevier BV","issue":"10","license":[{"start":{"date-parts":[[2009,10,1]],"date-time":"2009-10-01T00:00:00Z","timestamp":1254355200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2009,10]]},"DOI":"10.1016\/j.cor.2008.12.002","type":"journal-article","created":{"date-parts":[[2008,12,10]],"date-time":"2008-12-10T10:34:25Z","timestamp":1228905265000},"page":"2723-2728","source":"Crossref","is-referenced-by-count":9,"title":["Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming"],"prefix":"10.1016","volume":"36","author":[{"given":"Wenxing","family":"Zhu","sequence":"first","affiliation":[]},{"given":"M.M.","family":"Ali","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.cor.2008.12.002_bib1","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1109\/TR.1986.4335497","article-title":"Reliability optimization problems with multiple constraints","volume":"R-35","author":"Chern","year":"1986","journal-title":"IEEE Transactions on Reliability"},{"issue":"1","key":"10.1016\/j.cor.2008.12.002_bib2","first-page":"81","article-title":"An efficient algorithm to solve integer programming problems arising in system reliability design","volume":"R-40","author":"Mira","year":"1991","journal-title":"IEEE Transactions on Reliability"},{"key":"10.1016\/j.cor.2008.12.002_bib3","unstructured":"Sarker R, Runarsson T, Newton C. Genetic algorithms for solving a class of constrained nonlinear integer programs. In: Proceedings of the 15th Australian society for operational research conference, 1999. p. 1122\u201337."},{"issue":"1\u20134","key":"10.1016\/j.cor.2008.12.002_bib4","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BF02283698","article-title":"A note on adapting methods for continuous global optimization to the discrete case","volume":"25","author":"Benson","year":"1990","journal-title":"Annals of Operations Research"},{"issue":"6\/7","key":"10.1016\/j.cor.2008.12.002_bib5","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0898-1221(91)90164-Y","article-title":"An algorithm for indefinite integer quadratic programming","volume":"21","author":"Erenguc","year":"1991","journal-title":"Computers and Mathematics with Applications"},{"issue":"9","key":"10.1016\/j.cor.2008.12.002_bib6","doi-asserted-by":"crossref","first-page":"1011","DOI":"10.1016\/0305-0548(94)90072-8","article-title":"A branch and bound algorithm for solving separable convex integer programming problems","volume":"91","author":"Lee","year":"1994","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.cor.2008.12.002_bib7","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/BF02238637","article-title":"A Monte-Carlo approach for 0\u20131 programming problems","volume":"48","author":"Bertocchi","year":"1992","journal-title":"Computing"},{"key":"10.1016\/j.cor.2008.12.002_bib8","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1080\/03052159808941241","article-title":"MARS\u2014a multistart adaptive random search method for global constrained optimization in engineering applications","volume":"30","author":"Litinetski","year":"1998","journal-title":"Engineering Optimization"},{"key":"10.1016\/j.cor.2008.12.002_bib9","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/0377-2217(94)90215-1","article-title":"An approximate algorithm for nonlinear integer programming","volume":"74","author":"Vassilev","year":"1994","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cor.2008.12.002_bib10","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1023\/A:1008761113491","article-title":"A controlled random search technique incorporating the simulated annealing concept for solving integer and mixed integer global optimization problems","volume":"14","author":"Mohan","year":"1999","journal-title":"Computational Optimization and Applications"},{"key":"10.1016\/j.cor.2008.12.002_bib11","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s10589-005-0985-7","article-title":"Discrete filled function method for discrete global optimization","volume":"31","author":"Ng","year":"2005","journal-title":"Computational Optimization and Applications"},{"issue":"1","key":"10.1016\/j.cor.2008.12.002_bib12","first-page":"69","article-title":"An algorithm for finding global minimum of nonlinear integer programming","volume":"22","author":"Tian","year":"2004","journal-title":"Journal of Computational Mathematics"},{"key":"10.1016\/j.cor.2008.12.002_bib13","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/S0096-3003(97)10083-2","article-title":"An approximate algorithm for nonlinear integer programming","volume":"93","author":"Zhu","year":"1998","journal-title":"Applied Mathematics and Computation"},{"issue":"4","key":"10.1016\/j.cor.2008.12.002_bib14","first-page":"481","article-title":"A filled function method for integer programming","volume":"23","author":"Zhu","year":"2000","journal-title":"Acta Mathematicae Applicatae Sinica"},{"key":"10.1016\/j.cor.2008.12.002_bib15","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/S0377-2217(86)80006-6","article-title":"An exact penalty function approach for nonlinear integer programming problems","volume":"27","author":"Sinclair","year":"1986","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.cor.2008.12.002_bib16","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/s10898-006-9053-9","article-title":"Discrete global descent method for discrete global optimization and nonlinear integer programming","volume":"37","author":"Ng","year":"2007","journal-title":"Journal of Global Optimization"},{"issue":"1","key":"10.1016\/j.cor.2008.12.002_bib17","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1016\/j.cam.2008.01.023","article-title":"A discrete dynamic convexized method for nonlinear integer programming","volume":"223","author":"Zhu","year":"2009","journal-title":"Journal of Computational and Applied Mathematics"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054808002463?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054808002463?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,10]],"date-time":"2020-03-10T17:28:22Z","timestamp":1583861302000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054808002463"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10]]},"references-count":17,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2009,10]]}},"alternative-id":["S0305054808002463"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2008.12.002","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2009,10]]}}}