{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,30]],"date-time":"2026-07-30T09:21:38Z","timestamp":1785403298874,"version":"3.56.0"},"reference-count":13,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[1997,8,1]],"date-time":"1997-08-01T00:00:00Z","timestamp":870393600000},"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":[[1997,8]]},"DOI":"10.1016\/s0305-0548(97)00002-6","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:16:34Z","timestamp":1051128994000},"page":"699-701","source":"Crossref","is-referenced-by-count":28,"title":["A computational comparison of branch and bound and outer approximation algorithms for 0\u20131 mixed integer nonlinear programs"],"prefix":"10.1016","volume":"24","author":[{"given":"Brian","family":"Borchers","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"John E.","family":"Mitchell","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(97)00002-6_BIB1","series-title":"Nonlinear and Mixed-Integer Optimization: Fundamentals and Applications","author":"Floudas","year":"1995"},{"key":"10.1016\/S0305-0548(97)00002-6_BIB2","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0098-1354(89)85008-2","article-title":"Computational experience with DICOPT solving MINLP problems in process systems engineering","volume":"13","author":"Kocis","year":"1989","journal-title":"Computers and Chemical Engineering"},{"issue":"6","key":"10.1016\/S0305-0548(97)00002-6_BIB3","doi-asserted-by":"crossref","first-page":"902","DOI":"10.1287\/opre.37.6.902","article-title":"APROS: algorithmic development methodology for discrete-continuous optimization problems","volume":"37","author":"Paules","year":"1989","journal-title":"Operations Research"},{"issue":"3","key":"10.1016\/S0305-0548(97)00002-6_BIB4","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1287\/opre.18.3.454","article-title":"Quadratic binary programming with applications to capital-budgeting problems","volume":"18","author":"Laughhunn","year":"1970","journal-title":"Operations Research"},{"issue":"2","key":"10.1016\/S0305-0548(97)00002-6_BIB5","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1287\/mnsc.15.2.B51","article-title":"An extension of Lawler and Bell's method of discrete optimization with examples from capital budgeting","volume":"15","author":"Mao","year":"1968","journal-title":"Management Science"},{"issue":"4","key":"10.1016\/S0305-0548(97)00002-6_BIB6","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 programs","volume":"21","author":"Borchers","year":"1994","journal-title":"Computers and Operations Research"},{"issue":"4","key":"10.1016\/S0305-0548(97)00002-6_BIB7","first-page":"189","article-title":"Nonlinear integer programming algorithms: a survey","volume":"20","author":"Gupta","year":"1983","journal-title":"OPSEARCH"},{"issue":"12","key":"10.1016\/S0305-0548(97)00002-6_BIB8","doi-asserted-by":"crossref","first-page":"1533","DOI":"10.1287\/mnsc.31.12.1533","article-title":"Branch and bound experiments in convex nonlinear integer programming","volume":"31","author":"Gupta","year":"1985","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(97)00002-6_BIB9","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"},{"key":"10.1016\/S0305-0548(97)00002-6_BIB10","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1016\/0098-1354(90)87085-4","article-title":"A combined penalty function and outer approximation method for MINLP optimization","volume":"14","author":"Viswanathan","year":"1990","journal-title":"Computers and Chemical Engineering"},{"key":"10.1016\/S0305-0548(97)00002-6_BIB11","author":"Brooke","year":"1988"},{"key":"10.1016\/S0305-0548(97)00002-6_BIB12","author":"GAMS","year":"1993"},{"issue":"20","key":"10.1016\/S0305-0548(97)00002-6_BIB13","first-page":"16","article-title":"MIPLIB: a test set of mixed integer programming solutions","volume":"25","author":"Bixby","year":"1992","journal-title":"SIAM News"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054897000026?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054897000026?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T20:27:36Z","timestamp":1556396856000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054897000026"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,8]]},"references-count":13,"journal-issue":{"issue":"8","published-print":{"date-parts":[[1997,8]]}},"alternative-id":["S0305054897000026"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(97)00002-6","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1997,8]]}}}