{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T11:06:11Z","timestamp":1751367971957},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"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":[[1993]]},"DOI":"10.1007\/bf01096777","type":"journal-article","created":{"date-parts":[[2005,2,5]],"date-time":"2005-02-05T09:45:48Z","timestamp":1107596748000},"page":"377-391","source":"Crossref","is-referenced-by-count":7,"title":["Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems"],"prefix":"10.1007","volume":"3","author":[{"given":"L\ufffd D.","family":"Muu","sequence":"first","affiliation":[]},{"given":"W.","family":"Oettli","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1287\/moor.8.2.273","volume":"8","author":"F. A. Al-Khayyal","year":"1983","unstructured":"Al-Khayyal, F. A. and Falk, J. E. (1983), Jointly constrained biconvex programming,Mathematics of Operations Research 8, 273?286.","journal-title":"Mathematics of Operations Research"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"J. F. Benders","year":"1962","unstructured":"Benders, J. F. (1962), Partitioning procedures for solving mixed-variables programming problems,Numerische Mathematik 4, 238?252.","journal-title":"Numerische Mathematik"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF00934342","volume":"36","author":"H. P. Benson","year":"1982","unstructured":"Benson, H. P. (1982), On the convergence of two branch-and-bound algorithms for nonconvex programming problems,Journal of Optimization Theory and Applications 36, 129?134.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-66156-3","volume-title":"Mathematische Optimierung","author":"E. Blum","year":"1975","unstructured":"Blum, E. and Oettli, W. (1975),Mathematische Optimierung, Springer, Berlin."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BF01386389","volume":"1","author":"E. W. Cheney","year":"1959","unstructured":"Cheney, E. W. and Goldstein, A. A. (1959), Newton's method for convex programming and Tchebycheff approximation,Numerische Mathematik 1, 253?268.","journal-title":"Numerische Mathematik"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/opre.8.1.101","volume":"8","author":"G. B. Dantzig","year":"1960","unstructured":"Dantzig, G. B. and Wolfe, P. (1960), Decomposition principle for linear programs,Operations Research 8, 101?111.","journal-title":"Operations Research"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1287\/mnsc.15.9.550","volume":"15","author":"J. E. Falk","year":"1969","unstructured":"Falk, J. E. and Soland, R. M. (1969), An algorithm for separable nonconvex programming problems,Management Science 15, 550?569.","journal-title":"Management Science"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/opre.31.1.101","volume":"31","author":"M. Fukushima","year":"1983","unstructured":"Fukushima, M. (1983), An outer approximation algorithm for solving general convex programs,Operations Research 31, 101?113.","journal-title":"Operations Research"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0377-0427(84)90051-7","volume":"10","author":"M. Fukushima","year":"1984","unstructured":"Fukushima, M. (1984), On the convergence of a class of outer approximation algorithms for convex programs,Journal of Computational and Applied Mathematics 10, 147?156.","journal-title":"Journal of Computational and Applied Mathematics"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF02591883","volume":"30","author":"M. Fukushima","year":"1984","unstructured":"Fukushima, M. (1984), A descent algorithm for nonsmooth convex optimization,Mathematical Programming 30, 163?175.","journal-title":"Mathematical Programming"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1287\/mnsc.16.11.652","volume":"16","author":"A. Geoffrion","year":"1970","unstructured":"Geoffrion, A. (1970), Elements of large-scale mathematical programming, Part I: Concepts,Management Science 16, 652?675.","journal-title":"Management Science"},{"key":"CR12","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":"CR13","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0167-6377(88)90071-5","volume":"7","author":"R. Horst","year":"1988","unstructured":"Horst, R., de Vries, J., and Thoai, N. V. (1988), On finding new vertices and redundant constraints in cutting plane algorithms for global optimization,Operations Research Letters 7, 85?90.","journal-title":"Operations Research Letters"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/BF00939768","volume":"58","author":"R. Horst","year":"1988","unstructured":"Horst, R. (1988), Deterministic global optimization with partition sets whose feasibility is not known. Application to concave minimization, reverse convex constraints, DC-programming, and Lipschitzian optimization,Journal of Optimization Theory and Applications 58, 11?37.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BF00939434","volume":"54","author":"R. Horst","year":"1987","unstructured":"Horst, R. and Tuy, H. (1987), On the convergence of global methods in multiextremal optimization,Journal of Optimization Theory and Applications 54, 253?271.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02598-7","volume-title":"Global Optimization","author":"R. Horst","year":"1990","unstructured":"Horst, R. and Tuy, H. (1990),Global Optimization, Springer, Berlin; second edition 1992.","edition":"second edition"},{"key":"CR17","first-page":"703","volume":"8","author":"J. E. Kelley","year":"1960","unstructured":"Kelley, J. E. (1960), The cutting-plane method for solving convex programs,Journal of the SIAM 8, 703?712.","journal-title":"Journal of the SIAM"},{"key":"CR18","volume-title":"Lecture Notes in Mathematics","author":"K. C. Kiwiel","year":"1985","unstructured":"Kiwiel, K. C. (1985),Methods of Descent for Nondifferentiable Optimization, Lecture Notes in Mathematics1133, Springer, Berlin."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF00934131","volume":"42","author":"D. Q. Mayne","year":"1984","unstructured":"Mayne, D. Q. and Polak, E. (1984), Outer approximation algorithm for nondifferentiable optimization problems,Journal of Optimization Theory and Applications 42, 19?30.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"CR20","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF01580665","volume":"10","author":"G. P. McCormick","year":"1976","unstructured":"McCormick, G. P. (1976), Computability of global solutions to factorable nonconvex programs: Part I?Convex underestimating problems,Mathematical Programming 10, 147?175.","journal-title":"Mathematical Programming"},{"key":"CR21","first-page":"428","volume":"21","author":"L. D. Muu","year":"1985","unstructured":"Muu, L. D. (1985), A convergent algorithm for solving linear programs with an additional reverse convex constraint,Kybernetika (Prague) 21, 428?435.","journal-title":"Kybernetika (Prague)"},{"key":"CR22","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0167-6377(91)90004-9","volume":"10","author":"L. D. Muu","year":"1991","unstructured":"Muu, L. D. and Oettli, W. (1991), An algorithm for indefinite quadratic programming with convex constraints,Operations Research Letters 10, 323?327.","journal-title":"Operations Research Letters"},{"key":"CR23","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/BF00940633","volume":"70","author":"L. D. Muu","year":"1991","unstructured":"Muu, L. D. and Oettli, W. (1991), A method for minimizing a convex-concave function over a convex set,Journal of Optimization Theory and Applications 70, 377?384.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"CR24","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1145\/328512.328516","volume":"13","author":"P. M. Pardalos","year":"1987","unstructured":"Pardalos, P. M. (1987), Generation of large-scale quadratic programs for use as global optimization test problems,ACM Transactions on Mathematical Software 13, 133?137.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"CR25","doi-asserted-by":"crossref","unstructured":"Pardalos, P. M. and Rosen, J. B. (1987),Constrained Global Optimization: Algorithms and Applications. Lecture Notes in Computer Science268.","DOI":"10.1007\/BFb0000035"},{"key":"CR26","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF01580581","volume":"34","author":"J. B. Rosen","year":"1986","unstructured":"Rosen, J. B. and Pardalos, P. M. (1986), Global minimization of large-scale constrained concave quadratic problems by separable programming,Mathematical Programming 34, 163?174.","journal-title":"Mathematical Programming"},{"key":"CR27","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1287\/mnsc.17.11.759","volume":"17","author":"R. M. Soland","year":"1971","unstructured":"Soland, R. M. (1971), An algorithm for separable nonconvex programming problems II: Nonconvex constraints,Management Science 17, 759?773.","journal-title":"Management Science"},{"key":"CR28","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1287\/opre.18.3.404","volume":"18","author":"D. M. Topkis","year":"1970","unstructured":"Topkis, D. M. (1970), Cutting-plane methods without nested constraint sets,Operations Research 18, 404?413.","journal-title":"Operations Research"},{"key":"CR29","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1287\/moor.5.4.556","volume":"5","author":"N. V. Thoai","year":"1980","unstructured":"Thoai, N. V. and Tuy, H. (1980), Convergent algorithms for minimizing a concave function,Mathematics of Operations Research 5, 556?566.","journal-title":"Mathematics of Operations Research"},{"key":"CR30","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1007\/BFb0121159","volume":"30","author":"H. Tuy","year":"1987","unstructured":"Tuy, H. (1987), Global minimization of a difference of two convex functions,Mathematical Programming Study 30, 150?182.","journal-title":"Mathematical Programming Study"},{"key":"CR31","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF01580762","volume":"41","author":"H. Tuy","year":"1988","unstructured":"Tuy, H. and Horst, R. (1988), Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems,Mathematical Programming 41, 161?183.","journal-title":"Mathematical Programming"},{"key":"CR32","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 minimizing a concave function over a closed convex set,Mathematics of Operations Research 10, 498?514.","journal-title":"Mathematics of Operations Research"},{"key":"CR33","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1287\/opre.15.1.147","volume":"15","author":"A. F. Veinott","year":"1967","unstructured":"Veinott, A. F. (1967), The supporting hyperplane method for unimodal programming,Operations Research 15, 147?152.","journal-title":"Operations Research"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01096777.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01096777\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01096777","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T05:42:30Z","timestamp":1556343750000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01096777"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993]]}},"alternative-id":["BF01096777"],"URL":"https:\/\/doi.org\/10.1007\/bf01096777","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993]]}}}