乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T21:10:17Z","timestamp":1654895417215},"reference-count":47,"publisher":"Elsevier BV","issue":"12","license":[{"start":{"date-parts":[[2011,12,1]],"date-time":"2011-12-01T00:00:00Z","timestamp":1322697600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61070020, 10931003, and 60773126"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"National Key Basic Research Special Foundation (NKBRSF) of China","award":["2011CB808000"]},{"name":"Research Fund for the Doctoral Program (RFDP) of China","award":["20093514110004"]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2011,12]]},"DOI":"10.1016\/j.cor.2011.02.014","type":"journal-article","created":{"date-parts":[[2011,2,26]],"date-time":"2011-02-26T12:26:58Z","timestamp":1298723218000},"page":"1792-1804","source":"Crossref","is-referenced-by-count":5,"title":["A dynamic convexized method for nonconvex mixed integer nonlinear programming"],"prefix":"10.1016","volume":"38","author":[{"given":"Wenxing","family":"Zhu","sequence":"first","affiliation":[]},{"given":"Geng","family":"Lin","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.cor.2011.02.014_bib1","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1007\/BF01584657","article-title":"A computational comparison of some non-linear programs","volume":"4","author":"Asaadi","year":"1973","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.cor.2011.02.014_bib2","unstructured":"Belotti P, Lee J, Liberti L, Margot F, W\u00e4chter A. Branching and bounds tightening techniques for non-convex MINLP. Technical Report, IBM Research Report RC24620; 2008."},{"key":"10.1016\/j.cor.2011.02.014_bib3","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0305-0548(94)90024-8","article-title":"An improved branch and bound algorithm for mixed integer nonlinear programming","volume":"21","author":"Borchers","year":"1994","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.cor.2011.02.014_bib4","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1287\/ijoc.15.1.114.15159","article-title":"MINLPLib\u2014a collection of test models for mixed-integer nonlinear programming","volume":"15","author":"Bussieck","year":"2003","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/j.cor.2011.02.014_bib5","unstructured":"Bussieck MR, Pruessner A. Mixed-integer nonlinear programming. SIAG\/OPT Newsletter: View and News; 2003."},{"key":"10.1016\/j.cor.2011.02.014_bib6","doi-asserted-by":"crossref","first-page":"1349","DOI":"10.1016\/S0098-1354(97)00015-X","article-title":"A simulated annealing approach to the solution of MINLP problems","volume":"21","author":"Cardoso","year":"1997","journal-title":"Computers and Chemical Engineering"},{"key":"10.1016\/j.cor.2011.02.014_bib7","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.compchemeng.2005.07.012","article-title":"Optimization of block layout design problems with unequal areas: a comparison of MILP and MINLP optimization methods","volume":"30","author":"Castillo","year":"2005","journal-title":"Computers and Chemical Engineering"},{"key":"10.1016\/j.cor.2011.02.014_bib8","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/S0898-1221(97)00229-0","article-title":"Coupling genetic algorithm with a grid search method to solve mixed integer nonlinear programming problems","volume":"32","author":"Cheung","year":"1997","journal-title":"Computers and Mathematics with Applications"},{"key":"10.1016\/j.cor.2011.02.014_bib9","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S0098-1354(00)00653-0","article-title":"Evolutionary algorithms approach to the solution of mixed integer nonlinear programming problems","volume":"21","author":"Costa","year":"2001","journal-title":"Computers and Chemical Engineering"},{"key":"10.1016\/j.cor.2011.02.014_bib10","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1016\/j.amc.2009.02.044","article-title":"A real coded genetic algorithm for solving integer and mixed integer optimization problems","volume":"212","author":"Deep","year":"2009","journal-title":"Applied Mathematics and Computation"},{"key":"10.1016\/j.cor.2011.02.014_bib11","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/BF02592064","article-title":"An outer-approximation algorithm for a class of mixed-integer nonlinear programs","volume":"36","author":"Duran","year":"1986","journal-title":"Mathematical Programming"},{"issue":"8","key":"10.1016\/j.cor.2011.02.014_bib12","doi-asserted-by":"crossref","first-page":"1877","DOI":"10.1016\/j.compchemeng.2007.10.008","article-title":"A tabu search-based algorithm for mixed-integer nonlinear problems and its application to integrated process and control system design","volume":"32","author":"Exler","year":"2008","journal-title":"Computers and Chemical Engineering"},{"key":"10.1016\/j.cor.2011.02.014_bib13","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/s11590-006-0026-1","article-title":"A trust region SQP algorithm for mixed-integer nonlinear programming","volume":"1","author":"Exler","year":"2007","journal-title":"Optimization Letters"},{"key":"10.1016\/j.cor.2011.02.014_bib14","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BF01581153","article-title":"Solving mixed integer programs by outer approximation","volume":"66","author":"Fletcher","year":"1994","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.cor.2011.02.014_bib15","series-title":"Handbook of test problems in local and global optimization","author":"Floudas","year":"1999"},{"issue":"4","key":"10.1016\/j.cor.2011.02.014_bib16","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF00934810","article-title":"A generalized Benders decomposition","volume":"10","author":"Geoffrion","year":"1972","journal-title":"Journal of Optimization Theory and Applications"},{"key":"10.1016\/j.cor.2011.02.014_bib17","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1023\/A:1021039126272","article-title":"Review of nonlinear mixed-integer and disjunctive programming techniques","volume":"3","author":"Grossmann","year":"2002","journal-title":"Optimization and Engineering"},{"key":"10.1016\/j.cor.2011.02.014_bib18","unstructured":"Grossmann IE, Sahinidis NV, editors. Special issue on mixed integer programming and it's application to engineering, part I. Optimization and Engineering 2002;3(4)."},{"key":"10.1016\/j.cor.2011.02.014_bib19","unstructured":"Grossmann IE, Sahinidis NV, editors. Special issue on mixed integer programming and it's application to engineering, part II. Optimization and Engineering 2002;4(1)."},{"key":"10.1016\/j.cor.2011.02.014_bib20","series-title":"Global optimization using interval analysis","author":"Hansen","year":"2004"},{"key":"10.1016\/j.cor.2011.02.014_bib21","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF00934594","article-title":"Test examples for nonlinear programming codes","volume":"30","author":"Hock","year":"1980","journal-title":"Journal of Optimization Theory and Applications"},{"key":"10.1016\/j.cor.2011.02.014_bib23","doi-asserted-by":"crossref","first-page":"897","DOI":"10.1016\/j.amc.2005.05.017","article-title":"An efficient genetic algorithm approach to large scale mixed integer programming problems","volume":"174","author":"Hua","year":"2006","journal-title":"Applied Mathematics and Computation"},{"issue":"7","key":"10.1016\/j.cor.2011.02.014_bib24","doi-asserted-by":"crossref","first-page":"1623","DOI":"10.1002\/aic.690440714","article-title":"Cyclic scheduling of continuous parallel-process units with decaying performance","volume":"44","author":"Jain","year":"1998","journal-title":"AIChE Journal"},{"key":"10.1016\/j.cor.2011.02.014_bib25","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/s10898-007-9203-8","article-title":"A Lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures","volume":"41","author":"Karuppiah","year":"2008","journal-title":"Journal of Global Optimization"},{"key":"10.1016\/j.cor.2011.02.014_bib26","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1007\/s10107-004-0503-1","article-title":"Outer approximation algorithm for separable nonconvex mixed-integer nonlinear programs","volume":"100","author":"Kesavan","year":"2004","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.cor.2011.02.014_bib27","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1023\/A:1011241421041","article-title":"Integrating SQP and branch-and-bound for mixed integer nonlinear programming","volume":"18","author":"Leyffer","year":"2001","journal-title":"Computational Optimization and Applications"},{"key":"10.1016\/j.cor.2011.02.014_bib28","unstructured":"Leyffer S. Macminlp, ampl collection of mixed integer nonlinear programs \u3008http:\/\/wiki.mcs.anl.gov\/leyffer\/index.php\/MacMINLP\u3009, 2000."},{"key":"10.1016\/j.cor.2011.02.014_bib29","doi-asserted-by":"crossref","first-page":"1057","DOI":"10.1137\/S1052623403429573","article-title":"An algorithm model for mixed variable programming","volume":"15","author":"Lucidi","year":"2005","journal-title":"SIAM Journal on Optimization"},{"key":"10.1016\/j.cor.2011.02.014_bib30","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1023\/A:1021808313306","article-title":"A mixed-integer optimization strategy for oil supply in distribution complexes","volume":"4","author":"Mas","year":"2003","journal-title":"Optimization and Engineering"},{"key":"10.1016\/j.cor.2011.02.014_bib32","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0167-6377(88)90049-1","article-title":"Checking local optimality in constrained quadratic programming is NP-hard","volume":"7","author":"Pardalos","year":"1988","journal-title":"Operations Research Letters"},{"key":"10.1016\/j.cor.2011.02.014_bib33","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1021\/ie060733d","article-title":"Mixed integer nonlinear programming optimization strategies for batch plant design problems","volume":"46","author":"Ponsich","year":"2007","journal-title":"Industrial and Engineering Chemistry Research"},{"key":"10.1016\/j.cor.2011.02.014_bib34","doi-asserted-by":"crossref","first-page":"937","DOI":"10.1016\/0098-1354(92)80028-8","article-title":"An LP\/NLP based branch and bound algorithm for convex MINLP optimization problems","volume":"16","author":"Quesada","year":"1992","journal-title":"Computers and Chemical Engineering"},{"key":"10.1016\/j.cor.2011.02.014_bib35","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF00138693","article-title":"Baron: a general purpose global optimization software package","volume":"8","author":"Sahinidis","year":"1996","journal-title":"Journal of Global Optimization"},{"key":"10.1016\/j.cor.2011.02.014_bib36","doi-asserted-by":"crossref","first-page":"2217","DOI":"10.1016\/j.cor.2008.08.015","article-title":"Extended ant colony optimization for non-convex mixed integer nonlinear programming","volume":"36","author":"Schl\u00fcter","year":"2009","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.cor.2011.02.014_bib37","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1007\/s10107-003-0467-6","article-title":"Global optimization of mixed-integer nonlinear program: a theoretical and computational study","volume":"99","author":"Tawarmalani","year":"2004","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.cor.2011.02.014_bib38","unstructured":"Ugray Z, Lasdon L, Plummer J, Glover F, Kelly J, Marti R. A multistart scatter search heuristic for smooth NLP and MINLP problems \u3008http:\/\/www.utexas.edu\/courses\/lasdon\/papers.htm\u3009, 2002."},{"key":"10.1016\/j.cor.2011.02.014_bib39","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10898-006-9107-z","article-title":"Simulated annealing with asymptotic convergence for nonlinear constrained optimization","volume":"39","author":"Wah","year":"2007","journal-title":"Journal of Global Optimization"},{"key":"10.1016\/j.cor.2011.02.014_bib40","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0098-1354(95)87027-X","article-title":"A cutting plane method for solving convex MINLP problems","volume":"19","author":"Westerlund","year":"1995","journal-title":"Computers and Chemical Engineering"},{"key":"10.1016\/j.cor.2011.02.014_bib41","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1023\/A:1021091110342","article-title":"Solving pseudo-convex mixed integer optimization problems by cutting plane techniques","volume":"3","author":"Westerlund","year":"2002","journal-title":"Optimization and Engineering"},{"key":"10.1016\/j.cor.2011.02.014_bib42","series-title":"Integer and combinatorial optimization","author":"Wolsey","year":"1998"},{"key":"10.1016\/j.cor.2011.02.014_bib43","doi-asserted-by":"crossref","first-page":"2647","DOI":"10.1016\/j.compchemeng.2004.07.027","article-title":"Solving mixed integer nonlinear programming problems with line-up competition algorithm","volume":"28","author":"Yan","year":"2004","journal-title":"Computers and Chemical Engineering"},{"key":"10.1016\/j.cor.2011.02.014_bib44","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/j.compchemeng.2006.05.016","article-title":"An improved PSO algorithm for solving non-convex NLP\/MINLP problems with equality constraints","volume":"31","author":"Yiqing","year":"2007","journal-title":"Computers and Chemical Engineering"},{"key":"10.1016\/j.cor.2011.02.014_bib45","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1145\/279232.279236","article-title":"L-BFGS-B: Algorithm 778: L-BFGS-B, FORTRAN routines for large scale bound constrained optimization","volume":"23","author":"Zhu","year":"1997","journal-title":"ACM Transactions on Mathematical Software"},{"key":"10.1016\/j.cor.2011.02.014_bib46","doi-asserted-by":"crossref","unstructured":"Zhu WX. A dynamic convexized function with the same global minimizers for global optimization. In: Lecture notes in computer science, vol. 4221, 2006. p. 939\u201348.","DOI":"10.1007\/11881070_124"},{"key":"10.1016\/j.cor.2011.02.014_bib47","doi-asserted-by":"crossref","first-page":"2723","DOI":"10.1016\/j.cor.2008.12.002","article-title":"Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming","volume":"36","author":"Zhu","year":"2009","journal-title":"Computers and Operations Research"},{"issue":"2","key":"10.1016\/j.cor.2011.02.014_bib48","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1016\/j.cam.2008.12.017","article-title":"Solving nonlinearly constrained global optimization problem via an auxiliary function method","volume":"230","author":"Zhu","year":"2009","journal-title":"Journal of Computational and Applied Mathematics"},{"key":"10.1016\/j.cor.2011.02.014_bib49","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:S0305054811000566?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054811000566?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,4]],"date-time":"2018-12-04T13:53:17Z","timestamp":1543931597000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054811000566"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12]]},"references-count":47,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2011,12]]}},"alternative-id":["S0305054811000566"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2011.02.014","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2011,12]]}}}