{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T11:06:06Z","timestamp":1751367966099},"reference-count":46,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[1994,8,1]],"date-time":"1994-08-01T00:00:00Z","timestamp":775699200000},"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 &amp; Operations Research"],"published-print":{"date-parts":[[1994,8]]},"DOI":"10.1016\/0305-0548(94)90007-8","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T12:15:45Z","timestamp":1056975345000},"page":"777-785","source":"Crossref","is-referenced-by-count":9,"title":["A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron"],"prefix":"10.1016","volume":"21","author":[{"given":"Kurt M.","family":"Bretthauer","sequence":"first","affiliation":[]},{"given":"A.Victor","family":"Cabot","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(94)90007-8_BIB1","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1287\/opre.31.5.803","article-title":"Solving large-scale zero-one linear programming problems","volume":"31","author":"Crowder","year":"1983","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(94)90007-8_BIB2","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1287\/opre.35.1.45","article-title":"Solving mixed integer programming problems using automatic reformulation","volume":"35","author":"Van Roy","year":"1987","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(94)90007-8_BIB3","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/0167-6377(90)90059-E","article-title":"Separable concave minimization via partial outer approximation and branch and bound","volume":"9","author":"Benson","year":"1990","journal-title":"Ops Res. Lett"},{"key":"10.1016\/0305-0548(94)90007-8_BIB4","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0898-1221(91)90161-V","article-title":"A branch and bound-outer approximation algorithm for concave minimization over a convex set","volume":"21","author":"Benson","year":"1991","journal-title":"Comps Math. Applies"},{"key":"10.1016\/0305-0548(94)90007-8_BIB5","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/BF01594938","article-title":"Concave minimization via conical partitions and polyhedral outer approximation","volume":"50","author":"Horst","year":"1991","journal-title":"Mathl Programm."},{"key":"10.1016\/0305-0548(94)90007-8_BIB6","first-page":"1437","article-title":"Concave programming under linear constraints","volume":"5","author":"Tuy","year":"1964","journal-title":"Soviet Maths"},{"key":"10.1016\/0305-0548(94)90007-8_BIB7","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF01586935","article-title":"Normal conical algorithm for concave minimization over polytopes","volume":"51","author":"Tuy","year":"1991","journal-title":"Mathl Program."},{"key":"10.1016\/0305-0548(94)90007-8_BIB8","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1002\/nav.3800320119","article-title":"A finite algorithm for concave minimization over a polyhedron","volume":"32","author":"Benson","year":"1985","journal-title":"Naval Res. logist. Q."},{"key":"10.1016\/0305-0548(94)90007-8_BIB9","series-title":"A finite concave minimization algorithm using branch and bound and neighbor generation","author":"Benson","year":"1992"},{"key":"10.1016\/0305-0548(94)90007-8_BIB10","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1287\/mnsc.15.9.550","article-title":"An algorithm for separable nonconvex programming problems","volume":"15","author":"Falk","year":"1969","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(94)90007-8_BIB11","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1007\/BF01580678","article-title":"An algorithm for nonconvex programming problems","volume":"10","author":"Horst","year":"1976","journal-title":"Mathl Program."},{"key":"10.1016\/0305-0548(94)90007-8_BIB12","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF00939825","article-title":"A general class of branch and bound methods in global optimization with some new approaches for concave minimization","volume":"51","author":"Horst","year":"1986","journal-title":"J. Optimization Theory Applic."},{"key":"10.1016\/0305-0548(94)90007-8_BIB13","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1287\/moor.5.4.556","article-title":"Convergent algorithms for minimizing a concave function","volume":"5","author":"Thoai","year":"1980","journal-title":"Maths Ops Res."},{"key":"10.1016\/0305-0548(94)90007-8_BIB14","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF01580762","article-title":"Convergence and restart in branch and bound algorithms for global optimization. Application to concave minimization and D.C. optimization problems","volume":"41","author":"Tuy","year":"1988","journal-title":"Mathl Program."},{"key":"10.1016\/0305-0548(94)90007-8_BIB15","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/moor.10.3.498","article-title":"A conical algorithm for globally minimizing a concave function over a closed convex set","volume":"10","author":"Tuy","year":"1985","journal-title":"Maths Ops Res."},{"key":"10.1016\/0305-0548(94)90007-8_BIB16","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1002\/nav.3800210206","article-title":"Variations on a cutting plane method for solving concave minimization problems with linear constraints","volume":"21","author":"Cabot","year":"1974","journal-title":"Naval Res. logist. Q."},{"key":"10.1016\/0305-0548(94)90007-8_BIB17","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0012-365X(74)90070-3","article-title":"Quasiconcave minimization subject to linear constraints","volume":"9","author":"Mathjay","year":"1974","journal-title":"Discrete Maths"},{"key":"10.1016\/0305-0548(94)90007-8_BIB18","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1287\/opre.22.3.602","article-title":"Global maximization of a convex function with linear inequality constraints","volume":"22","author":"Zwart","year":"1973","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(94)90007-8_BIB19","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1287\/moor.1.3.251","article-title":"A successive underestimation method for concave minimization problems","volume":"1","author":"Falk","year":"1976","journal-title":"Maths Ops Res."},{"key":"10.1016\/0305-0548(94)90007-8_BIB20","doi-asserted-by":"crossref","first-page":"919","DOI":"10.1287\/opre.34.6.919","article-title":"Concave minimization via collapsing polytopes","volume":"34","author":"Falk","year":"1986","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(94)90007-8_BIB21","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0167-6377(91)90030-S","article-title":"On the minimization of a quasi-concave function subject to linear constraints","volume":"10","author":"Garcia-Palomares","year":"1991","journal-title":"Ops Res. Lett."},{"key":"10.1016\/0305-0548(94)90007-8_BIB22","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1002\/nav.3800200313","article-title":"Concave minimization over a convex polyhedron","volume":"20","author":"Taha","year":"1973","journal-title":"Naval Res. logist. Q."},{"key":"10.1016\/0305-0548(94)90007-8_BIB23","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/BF00938310","article-title":"Using convex envelopes to solve the interactive fixed-charge linear programming problem","volume":"59","author":"Benson","year":"1988","journal-title":"J. Optimization Theory Applic."},{"key":"10.1016\/0305-0548(94)90007-8_BIB24","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1002\/nav.3800330202","article-title":"The interactive fixed charge linear programming problem","volume":"33","author":"Erenguc","year":"1986","journal-title":"Naval Res. logist. Q."},{"key":"10.1016\/0305-0548(94)90007-8_BIB25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/nav.3220350102","article-title":"Multiproduct dynamic lot-sizing model with coordinated replenishments","volume":"35","author":"Erenguc","year":"1988","journal-title":"Naval Res. logist. Q."},{"key":"10.1016\/0305-0548(94)90007-8_BIB26","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/BF01580763","article-title":"Minimum concave cost production system: a further generalization of multi-echelon model","volume":"41","author":"Konno","year":"1988","journal-title":"Mathl Program."},{"key":"10.1016\/0305-0548(94)90007-8_BIB27","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1287\/opre.22.2.373","article-title":"Optimal facility location with concave costs","volume":"22","author":"Soland","year":"1974","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(94)90007-8_BIB28","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1080\/07421222.1987.11517800","article-title":"Embedding a point-to-point network in the expansion of infrastructure for information systems","volume":"4","author":"Veroy","year":"1987","journal-title":"J. Mgmt Inf. Syst."},{"key":"10.1016\/0305-0548(94)90007-8_BIB29","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1080\/07421222.1988.11517824","article-title":"Capacity expansion for information flow distribution in multi-path computer communication networks","volume":"5","author":"Zwass","year":"1988","journal-title":"J. Mgmt Inf. Syst."},{"key":"10.1016\/0305-0548(94)90007-8_BIB30","doi-asserted-by":"crossref","first-page":"1241","DOI":"10.1016\/0045-7949(73)90048-5","article-title":"Algorithmic and computational aspects of the use of optimization methods in engineering design","volume":"3","author":"McCormick","year":"1973","journal-title":"Comps Struct."},{"key":"10.1016\/0305-0548(94)90007-8_BIB31","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF02283688","article-title":"Minimum concave cost network flow problems: applications, complexity, and algorithms","volume":"25","author":"Guisewite","year":"1990","journal-title":"Ann. Ops Res."},{"key":"10.1016\/0305-0548(94)90007-8_BIB32","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/BF00130828","article-title":"Global search algorithms for minimum concave cost network flow problems","volume":"1","author":"Guisewite","year":"1991","journal-title":"J. Global Optimization"},{"key":"10.1016\/0305-0548(94)90007-8_BIB33","first-page":"106","article-title":"Relationship between bilinear programming and concave programming","volume":"2","author":"Thieu","year":"1980","journal-title":"Acta Math. Vietnam."},{"key":"10.1016\/0305-0548(94)90007-8_BIB34","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/BFb0120783","article-title":"Characterization of linear complementarity problems as linear programs","volume":"7","author":"Mangasarian","year":"1978","journal-title":"Mathl Program. Study"},{"key":"10.1016\/0305-0548(94)90007-8_BIB35","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF01580119","article-title":"A linear max-min problem","volume":"5","author":"Falk","year":"1973","journal-title":"Mathl Program."},{"key":"10.1016\/0305-0548(94)90007-8_BIB36","doi-asserted-by":"crossref","first-page":"680","DOI":"10.1287\/opre.17.4.680","article-title":"On connections between zero-one integer programming and concave programming under linear constraints","volume":"17","author":"Raghavachari","year":"1969","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(94)90007-8_BIB37","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1002\/1520-6750(199008)37:4<515::AID-NAV3220370406>3.0.CO;2-X","article-title":"An algorithm for concave integer minimization over a polyhedron","volume":"37","author":"Benson","year":"1990","journal-title":"Naval Res. logist."},{"key":"10.1016\/0305-0548(94)90007-8_BIB38","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":"Ann. Ops Res."},{"key":"10.1016\/0305-0548(94)90007-8_BIB39","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1002\/1520-6750(199404)41:3<435::AID-NAV3220410309>3.0.CO;2-6","article-title":"An algorithm and new penalties for concave integer minimization over a polyhedron","volume":"41","author":"Bretthauer","year":"1994","journal-title":"Naval Res. logist"},{"key":"10.1016\/0305-0548(94)90007-8_BIB40","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":"Naval Res. logist. Q."},{"key":"10.1016\/0305-0548(94)90007-8_BIB41","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1137\/1028106","article-title":"Methods for global concave minimization: a bibliographic survey","volume":"28","author":"Pardalos","year":"1986","journal-title":"SIAM Rev."},{"key":"10.1016\/0305-0548(94)90007-8_BIB42","article-title":"Constrained Global Optimization: Algorithms and Applications","volume":"Vol. 268","author":"Pardalos","year":"1987"},{"key":"10.1016\/0305-0548(94)90007-8_BIB43","series-title":"Global Optimization: Deterministic Approaches","author":"Horst","year":"1990"},{"key":"10.1016\/0305-0548(94)90007-8_BIB44","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF01580380","article-title":"Maximization of a convex quadratic function under linear constraints","volume":"11","author":"Konno","year":"1976","journal-title":"Mathl Program."},{"key":"10.1016\/0305-0548(94)90007-8_BIB45","article-title":"A Collection of Test Problems for Constrained Global Optimization Algorithms","volume":"Vol. 455","author":"Floudas","year":"1990"},{"key":"10.1016\/0305-0548(94)90007-8_BIB46","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1145\/355972.355976","article-title":"The design of the XMP linear programming library","volume":"7","author":"Marsten","year":"1981","journal-title":"ACM Trans. Mathl Software"}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894900078?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894900078?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T13:27:24Z","timestamp":1552915644000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054894900078"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,8]]},"references-count":46,"journal-issue":{"issue":"7","published-print":{"date-parts":[[1994,8]]}},"alternative-id":["0305054894900078"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(94)90007-8","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1994,8]]}}}