{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T10:46:45Z","timestamp":1751366805760},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1994,7,1]],"date-time":"1994-07-01T00:00:00Z","timestamp":773020800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[1994,7]]},"DOI":"10.1007\/bf01096999","type":"journal-article","created":{"date-parts":[[2005,2,7]],"date-time":"2005-02-07T03:43:31Z","timestamp":1107747811000},"page":"1-14","source":"Crossref","is-referenced-by-count":13,"title":["A finite concave minimization algorithm using branch and bound and neighbor generation"],"prefix":"10.1007","volume":"5","author":[{"given":"Harold P.","family":"Benson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Serpil","family":"Sayin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1002\/nav.3800320119","volume":"32","author":"H. P. Benson","year":"1985","unstructured":"Benson, H. P. (1985), A Finite Algorithm for Concave Minimization over a Polyhedron,Naval Research Logistics Quarterly 32, 165?177.","journal-title":"Naval Research Logistics Quarterly"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1002\/1520-6750(199008)37:4<515::AID-NAV3220370406>3.0.CO;2-X","volume":"37","author":"H. P. Benson","year":"1990","unstructured":"Benson, H. P. and Erenguc, S. S. (1990), An Algorithm for Concave Integer Minimization over a Polyhedron,Naval Research Logistics 37, 515?525.","journal-title":"Naval Research Logistics"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0305-0483(81)90038-4","volume":"9","author":"C. D. Heising-Goodman","year":"1981","unstructured":"Heising-Goodman, C. D. (1981), A Survey of Methodology for the Global Minimization of Concave Functions Subject to Convex Constraints,Omega 9, 313?319.","journal-title":"Omega"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1007\/BF01580678","volume":"10","author":"R. Horst","year":"1976","unstructured":"Horst, R. (1976), An Algorithm for Nonconvex Programming Problems,Mathematical Programming 10, 312?321.","journal-title":"Mathematical Programming"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF01720068","volume":"6","author":"R. Horst","year":"1984","unstructured":"Horst, R. (1984), On the Global Minimization of Concave Functions: Introduction and Survey,Operations Research Spektrum 6, 195?205.","journal-title":"Operations Research Spektrum"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1002\/1520-6750(199008)37:4<433::AID-NAV3220370403>3.0.CO;2-2","volume":"37","author":"R. Horst","year":"1990","unstructured":"Horst, R. (1990), Deterministic Methods in Constrained Global Optimization: Some Recent Advances and New Fields of Application,Naval Research Logistics 37, 433?471.","journal-title":"Naval Research Logistics"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/BF01594938","volume":"50","author":"R. Horst","year":"1991","unstructured":"Horst, R., Thoai, N. V., and Benson, H. P. (1991), Concave Minimization via Conical Partitions and Polyhedral Outer Approximation,Mathematical Programming 50, 259?274.","journal-title":"Mathematical Programming"},{"key":"CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02947-3","volume-title":"Global Optimization (Deterministic Approaches)","author":"R. Horst","year":"1993","unstructured":"Horst, R. and Tuy, H. (1993),Global Optimization (Deterministic Approaches), 2nd Edition, Springer, Berlin.","edition":"2nd Edition"},{"key":"CR9","volume-title":"Optimization Subroutine Library Guide and Reference","author":"International Business Machines","year":"1990","unstructured":"International Business Machines (1990),Optimization Subroutine Library Guide and Reference, International Business Machines, Mechanicsburg, Pennsylvania."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF01580380","volume":"11","author":"H. Konno","year":"1976","unstructured":"Konno, H. (1976), Maximization of a Convex Quadratic Function Subject to Linear Constraints,Mathematical Programming 11, 117?127.","journal-title":"Mathematical Programming"},{"key":"CR11","first-page":"209","volume-title":"Numerical Methods for Nonlinear Optimization","author":"G. P. McCormick","year":"1972","unstructured":"McCormick, G. P. (1972), Attempts to Calculate Global Solutions of Problems that may have Local Minima, in F. Lootsma (ed.),Numerical Methods for Nonlinear Optimization, Academic Press, London, 209?221."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1287\/opre.16.2.268","volume":"16","author":"K. G. Murty","year":"1968","unstructured":"Murty, K. G. (1968), Solving the Fixed Charge Problem by Ranking the Extreme Points,Operations Research 16, 268?279.","journal-title":"Operations Research"},{"key":"CR13","volume-title":"Linear Programming","author":"K. G. Murty","year":"1983","unstructured":"Murty, K. G. (1983),Linear Programming, Wiley, New York."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1137\/1028106","volume":"28","author":"P. M. Pardalos","year":"1986","unstructured":"Pardalos, P. M. and Rosen, J. B. (1986), Methods for Global Concave Minimization: A Bibliographic Survey,SIAM Review 28, 367?379.","journal-title":"SIAM Review"},{"key":"CR15","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0000035","volume-title":"Constrained Global Optimization: Algorithms and Applications","author":"P. M. Pardalos","year":"1987","unstructured":"Pardalos, P. M. and Rosen, J. B. (1987),Constrained Global Optimization: Algorithms and Applications, Springer, Berlin."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0167-6377(88)90049-1","volume":"7","author":"P. M. Pardalos","year":"1987","unstructured":"Pardalos, P. M. and Schnitger, G. (1987), Checking Local Optimality in Constrained Quadratic Programming is NP-Hard,Operations Research Letters 7, 33?35.","journal-title":"Operations Research Letters"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1002\/nav.3800260405","volume":"26","author":"C. D. Pegden","year":"1979","unstructured":"Pegden, C. D. and Petersen, C. C. (1979), An Algorithm (GIPC2) for Solving Integer Programming Problems with Separable Nonlinear Objective Functions,Naval Research Logistics Quarterly 26, 595?609.","journal-title":"Naval Research Logistics Quarterly"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1287\/moor.8.2.215","volume":"8","author":"J. B. Rosen","year":"1983","unstructured":"Rosen, J. B. (1983), Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain,Mathematics of Operations Research 8, 215?230.","journal-title":"Mathematics of Operations Research"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1287\/opre.22.2.373","volume":"22","author":"R. M. Soland","year":"1974","unstructured":"Soland, R. M. (1974), Optimal Facility Location with Concave Costs,Operations Research 22, 373?382.","journal-title":"Operations Research"},{"key":"CR20","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/moor.10.3.498","volume":"10","author":"H. Tuy","year":"1985","unstructured":"Tuy, H., Thieu, T. V. and Thai, N. Q. (1985), A Conical Algorithm for Globally Minimizating a Concave Function over a Closed, Convex Set,Mathematics of Operations Research 10, 498?514.","journal-title":"Mathematics of Operations Research"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01096999.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01096999\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01096999","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T09:00:26Z","timestamp":1556701226000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01096999"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,7]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,7]]}},"alternative-id":["BF01096999"],"URL":"https:\/\/doi.org\/10.1007\/bf01096999","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,7]]}}}