{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,26]],"date-time":"2024-07-26T20:36:11Z","timestamp":1722026171196},"reference-count":29,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[1994,11,1]],"date-time":"1994-11-01T00:00:00Z","timestamp":783648000000},"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":[[1994,11]]},"DOI":"10.1016\/0305-0548(94)90072-8","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"1011-1024","source":"Crossref","is-referenced-by-count":9,"title":["A branch and bound algorithm for solving separable convex integer programming problems"],"prefix":"10.1016","volume":"21","author":[{"given":"Won J.","family":"Lee","sequence":"first","affiliation":[]},{"given":"A.Victor","family":"Cabot","sequence":"additional","affiliation":[]},{"given":"M.A.","family":"Venkataramanan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(94)90072-8_BIB1","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1287\/mnsc.9.1.50","article-title":"A general algorithm for the optimal distribution of effort","volume":"9","author":"Karush","year":"1962","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(94)90072-8_BIB2","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1287\/opre.1.2.52","article-title":"The optimum distribution of effort","volume":"1","author":"Koopman","year":"1953","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(94)90072-8_BIB3","series-title":"Applied Dynamic Programming","author":"Bellman","year":"1962"},{"key":"10.1016\/0305-0548(94)90072-8_BIB4","article-title":"Solving Discrete-Variable Multiople-Constraint Nonlinear Programs: The Decision-State Method","author":"Dharmadhikari","year":"1975"},{"key":"10.1016\/0305-0548(94)90072-8_BIB5","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1109\/TR.1971.5216110","article-title":"A method of solving redundancy optimization problems","volume":"R-20","author":"Misra","year":"1971","journal-title":"IEEE Trans. Reliability"},{"key":"10.1016\/0305-0548(94)90072-8_BIB6","doi-asserted-by":"crossref","first-page":"887","DOI":"10.1287\/mnsc.13.11.887","article-title":"Integer programming formulation of constrained reliability problems","volume":"13","author":"Tillman","year":"1967","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(94)90072-8_BIB7","doi-asserted-by":"crossref","first-page":"938","DOI":"10.1287\/mnsc.34.8.938","article-title":"Determining optimal reorder intervals in capacitated production distribution systems","volume":"34","author":"Jackson","year":"1988","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(94)90072-8_BIB8","doi-asserted-by":"crossref","first-page":"1316","DOI":"10.1287\/opre.33.6.1316","article-title":"Establishing consistent and realistic reorder intervals in production-distribution systems","volume":"33","author":"Maxwell","year":"1985","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(94)90072-8_BIB9","series-title":"Mathematical Programming in Statistics","author":"Arthanari","year":"1981"},{"key":"10.1016\/0305-0548(94)90072-8_BIB10","first-page":"189","article-title":"Nonlinear integer programming algorithms: a survey","volume":"22","author":"Gupta","year":"1983","journal-title":"Opsearch"},{"key":"10.1016\/0305-0548(94)90072-8_BIB11","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1287\/mnsc.27.3.353","article-title":"A suevey of method for pure nonlinear integer programming","volume":"27","author":"Cooper","year":"1981","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(94)90072-8_BIB12","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1287\/opre.21.1.156","article-title":"Further reduction of zero-one polynomial problems to zero-one linear programming problems","volume":"22","author":"Glover","year":"1973","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(94)90072-8_BIB13","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1287\/opre.22.1.180","article-title":"Converting the 0\u20131 polynomial programming problems to a 0\u20131 linear program","volume":"22","author":"Glover","year":"1974","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(94)90072-8_BIB14","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1287\/opre.15.6.1171","article-title":"Reduction of integer polymomial programming problems to zero-one problems","volume":"15","author":"Watters","year":"1967","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(94)90072-8_BIB15","doi-asserted-by":"crossref","first-page":"1147","DOI":"10.1287\/mnsc.22.10.1147","article-title":"An algorithm for nonlinear knapsack problems","volume":"22","author":"Morin","year":"1976","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(94)90072-8_BIB16","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF01588949","article-title":"A hybrid approach to discrete mathematical programming","volume":"14","author":"Marsten","year":"1978","journal-title":"Mathl Program."},{"key":"10.1016\/0305-0548(94)90072-8_BIB17","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0898-1221(75)90020-6","article-title":"Nonlinear integer programming","volume":"1","author":"Cooper","year":"1975","journal-title":"Comps Math. Applic."},{"key":"10.1016\/0305-0548(94)90072-8_BIB18","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1002\/nav.3800270108","article-title":"The use of dynamic programming methdology for the solution of a class of nonlinear programming problems","volume":"27","author":"Cooper","year":"1980","journal-title":"NRLQ"},{"key":"10.1016\/0305-0548(94)90072-8_BIB19","doi-asserted-by":"crossref","first-page":"1533","DOI":"10.1287\/mnsc.31.12.1533","article-title":"Branch and bound experimentations in convex nonlinear integer programming","volume":"31","author":"Gupta","year":"1985","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(94)90072-8_BIB20","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1002\/nav.3800330403","article-title":"A branch and bound algorithm for solving a class of nonlinear integer programming problems","volume":"33","author":"Cabot","year":"1986","journal-title":"NRLQ"},{"key":"10.1016\/0305-0548(94)90072-8_BIB21","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1002\/nav.3800010408","article-title":"Minimization of nonlinear separable functions","volume":"1","author":"Charnes","year":"1954","journal-title":"NRLQ"},{"key":"10.1016\/0305-0548(94)90072-8_BIB22","series-title":"Linear Programming and Extensions","author":"Dantzig","year":"1963"},{"key":"10.1016\/0305-0548(94)90072-8_BIB23","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1145\/355769.355773","article-title":"Design and testing of a generalized reduced gradient code for nonlinear programming","volume":"4","author":"Lasdon","year":"1978","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/0305-0548(94)90072-8_BIB24","series-title":"Optimization","first-page":"37","article-title":"Generalization of the Wolfe reduced gradient method to the case of nonlinear constraints","author":"Abadie","year":"1969"},{"key":"10.1016\/0305-0548(94)90072-8_BIB25","author":"Colville","year":"1968"},{"key":"10.1016\/0305-0548(94)90072-8_BIB26","author":"Marsten","year":"1989"},{"key":"10.1016\/0305-0548(94)90072-8_BIB27","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1145\/363744.363779","article-title":"Construction of nonlinear programming test problems","volume":"8","author":"Rosen","year":"1965","journal-title":"Commun. ACM"},{"key":"10.1016\/0305-0548(94)90072-8_BIB28","article-title":"Solving nonlinear integer programs with a subgradient approach on parallel computers","author":"Bixby","year":"1992","journal-title":"SIAM News"},{"key":"10.1016\/0305-0548(94)90072-8_BIB29","series-title":"Nonlinear and Dynamic Programming","author":"Hadley","year":"1972"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894900728?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894900728?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T17:27:57Z","timestamp":1552930077000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054894900728"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,11]]},"references-count":29,"journal-issue":{"issue":"9","published-print":{"date-parts":[[1994,11]]}},"alternative-id":["0305054894900728"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(94)90072-8","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1994,11]]}}}