{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T21:30:41Z","timestamp":1770499841390,"version":"3.49.0"},"reference-count":87,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Global Optimization"],"published-print":{"date-parts":[[1998,1]]},"DOI":"10.1023\/a:1008241411395","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T13:47:34Z","timestamp":1040564854000},"page":"1-36","source":"Crossref","is-referenced-by-count":67,"title":["A Finite Algorithm for Global Minimization of Separable Concave Programs"],"prefix":"10.1007","volume":"12","author":[{"given":"J. Parker","family":"Shectman","sequence":"first","affiliation":[]},{"given":"Nikolaos V.","family":"Sahinidis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"141359_CR1","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF00940629","volume":"70","author":"F. Al-Khayyal","year":"1991","unstructured":"F. Al-Khayyal and J. Kyparisis. Finite convergence of algorithms for nonlinear programs and variational inequalities. Journal of Optimization Theory and Applications, 70(2): 319\u2013332, 1991.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"141359_CR2","doi-asserted-by":"crossref","first-page":"991","DOI":"10.1057\/jors.1982.210","volume":"33","author":"M. S. Bazaraa","year":"1982","unstructured":"M. S. Bazaraa and H. D. Sherali. On the use of exact and heuristic cutting plane methods for the quadratic assignment problem. Journal Operational Society, 33: 991\u20131003, 1982.","journal-title":"Journal Operational Society"},{"key":"141359_CR3","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF02283685","volume":"25","author":"S. Ben Saad","year":"1990","unstructured":"S. Ben Saad and S. E. Jacobsen. A level set algorithm for a class of reverse convex programs. {tiAnnals of Operations Research}, 25: 19\u201342, 1990.","journal-title":"{tiAnnals of Operations Research"},{"key":"141359_CR4","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1002\/nav.3800320119","volume":"32","author":"H. P. Benson","year":"1985","unstructured":"H. P. Benson. A finite algorithm for concave minimization over a polyhedron. Naval Research Logistics Quarterly, 32: 165\u2013177, 1985.","journal-title":"Naval Research Logistics Quarterly"},{"key":"141359_CR5","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/0167-6377(90)90059-E","volume":"9","author":"H. P. Benson","year":"1990","unstructured":"H. P. Benson. Separable concave minimization via partial outer approximation and branch and bound. Operations Research Letters, 9: 389\u2013394, 1990.","journal-title":"Operations Research Letters"},{"key":"141359_CR6","doi-asserted-by":"crossref","unstructured":"H. P. Benson. Concave minimization: Theory, applications and algorithms. In, P. M. Pardalos and R. Horst (eds.) Handbook of Global Optimization, Chapter 3, Hingham, Massachusetts, 1994.","DOI":"10.1007\/978-1-4615-2025-2_3"},{"issue":"6\/7","key":"141359_CR7","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0898-1221(91)90161-V","volume":"21","author":"H. P. Benson","year":"1991","unstructured":"H. P. Benson and R. Horst. A branch and bound-outer approximation algorithm for concave minimization over a convex set. Computers Math Applications, 21(6\/7): 67\u201376, 1991.","journal-title":"Computers Math Applications"},{"key":"141359_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01096999","volume":"5","author":"H. P. Benson","year":"1994","unstructured":"H. P. Benson and S. Sayin. A finite concave minimization algorithm using branch and bound and neighbor generation. Journal of Global Optimization, 5: 1\u201314, 1994.","journal-title":"Journal of Global Optimization"},{"key":"141359_CR9","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1137\/0803042","volume":"3","author":"I. M. Bomze","year":"1993","unstructured":"I. M. Bomze and G. Danninger. A global optimization algorithm for concave quadratic programming problems. SIAM Journal of Optimization, 3: 826\u2013842, 1993.","journal-title":"SIAM Journal of Optimization"},{"key":"141359_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01096531","volume":"4","author":"I. M. Bomze","year":"1994","unstructured":"I. M. Bomze and G. Danninger. A finite algorithm for solving general quadratic problems. Journal of Global Optimization, 4: 1\u201316, 1994.","journal-title":"Journal of Global Optimization"},{"issue":"7","key":"141359_CR11","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1016\/0305-0548(94)90007-8","volume":"21","author":"K. M. Bretthauer","year":"1994","unstructured":"K. M. Bretthauer and A. V. Cabot. A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron. Computers in Operations Research, 21(7): 777\u2013785, 1994.","journal-title":"Computers in Operations Research"},{"key":"141359_CR12","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1287\/opre.18.1.82","volume":"18","author":"A. V. Cabot","year":"1970","unstructured":"A. V. Cabot and R. L. Francis. Solving certain nonconvex quadratic minimization problems by ranking the extreme points. Operations Research, 18: 82\u201386, 1970.","journal-title":"Operations Research"},{"key":"141359_CR13","series-title":"Technical Report ORC","volume-title":"Minimization of concave functions subject to linear constraints","author":"R. Carvajal-Moreno","year":"1972","unstructured":"R. Carvajal-Moreno. Minimization of concave functions subject to linear constraints. Technical Report ORC 72\u20133, Operations Research Center, University of California, Berkeley, 1972."},{"key":"141359_CR14","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971811","volume-title":"LINPACK User's Guide","author":"J. Dongarra","year":"1979","unstructured":"J. Dongarra, J. Bunch, C. Moler, and G. W. Stewart. LINPACK User's Guide. SIAM, Philadelphia, PA, 1979."},{"key":"141359_CR15","series-title":"Technical Report","volume-title":"Performance of various computers using standard linear equations software","author":"J. J. Dongarra","year":"1997","unstructured":"Jack J. Dongarra. Performance of various computers using standard linear equations software. Technical Report CS\u201389\u201385, Computer Science Department, University of Tennessee, Knoxville, and Mathematical Sciences Section, Oak Ridge National Laboratory, Oak Ridge, 1997."},{"key":"141359_CR16","doi-asserted-by":"crossref","unstructured":"M. C. Dorneich and N. V. Sahinidis. Global optimization algorithms for chip layout and compaction. {tiEngineering Optimization}, 25(2): 131\u2013154, 1995.","DOI":"10.1080\/03052159508941259"},{"key":"141359_CR17","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1287\/moor.8.3.381","volume":"8","author":"M. E. Dyer","year":"1983","unstructured":"M. E. Dyer. The complexity of vertex enumeration methods. Mathematics of Operations Research, 8: 381\u2013402, 1983.","journal-title":"Mathematics of Operations Research"},{"key":"141359_CR18","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF01593771","volume":"12","author":"M. E. Dyer","year":"1977","unstructured":"M. E. Dyer and L. G. Proll. An algorithm for determining all extreme points of a convex polytope. {tiMathematical Programming}, 12: 81\u201396, 1977.","journal-title":"{tiMathematical Programming}"},{"key":"141359_CR19","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF01580119","volume":"5","author":"J. E. Falk","year":"1973","unstructured":"J. E. Falk. A linear max\u2013min problem. Mathematical Programming, 5: 169\u2013188, 1973.","journal-title":"Mathematical Programming"},{"issue":"3","key":"141359_CR20","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1287\/moor.1.3.251","volume":"1","author":"J. E. Falk","year":"1976","unstructured":"J. E. Falk and K. R. Hoffman. A successive underestimation method for concave minimization problems. Mathematics of Operations Research, 1(3): 251\u2013259, 1976.","journal-title":"Mathematics of Operations Research"},{"issue":"9","key":"141359_CR21","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1287\/mnsc.15.9.550","volume":"15","author":"J. E. Falk","year":"1969","unstructured":"J. E. Falk and R. M. Soland. An algorithm for separable nonconvex programming problems. {tiManagement Science}, 15(9): 550\u2013569, 1969.","journal-title":"{tiManagement Science"},{"key":"141359_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-53032-0","volume-title":"A Collection of Test Problems for Constrained Global Optimization Algorithms","author":"C. A. Floudas","year":"1990","unstructured":"C. A. Floudas and P. M. Pardalos. A Collection of Test Problems for Constrained Global Optimization Algorithms. Number 268 in Lecture Notes in Computer Science. Springer\u2013Verlag, Berlin\u2013Heidelberg, 1990."},{"key":"141359_CR23","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1007\/BF01585532","volume":"7","author":"A. M. Frieze","year":"1974","unstructured":"A. M. Frieze. A bilinear programming formulation of the 3\u2013dimensional assignment problem. {tiMathematical Programming}, 7: 376\u2013379, 1974.","journal-title":"{tiMathematical Programming}"},{"key":"141359_CR24","volume-title":"Postoptimal Analyses, Parametric Programming, and Related Topics","author":"T. Gal","year":"1979","unstructured":"T. Gal. Postoptimal Analyses, Parametric Programming, and Related Topics. McGraw-Hill Internaional, London, 1979."},{"key":"141359_CR25","unstructured":"F. Gianessi and F. Niccolucci. Connections between nonlinear and integer programming problems. In, Symposia Mathematica XIX, Istituto Nazionale Di Alta Mathematica, pp. 161\u2013176, New York, 1976."},{"key":"141359_CR26","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1287\/opre.21.1.123","volume":"21","author":"F. Glover","year":"1973","unstructured":"F. Glover. Convexity cuts and cut search. Operations Research, 21: 123\u2013134, 1973.","journal-title":"Operations Research"},{"key":"141359_CR27","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1287\/opre.21.1.135","volume":"21","author":"F. Glover","year":"1973","unstructured":"F. Glover and D. Klingman. Concave programming applied to a special class of 0-1 integer programs. Operations Research, 21: 135\u2013140, 1973.","journal-title":"Operations Research"},{"key":"141359_CR28","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF01582889","volume":"52","author":"P. Hansen","year":"1991","unstructured":"P. Hansen, B. Jaumard, and S.-H. Lu. An analytical approach to global optimization. Mathematical Programming, Series B, 52: 227\u2013254, 1991.","journal-title":"Mathematical Programming, Series B"},{"key":"141359_CR29","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1007\/BF01589330","volume":"22","author":"K. L. Hoffman","year":"1981","unstructured":"K. L. Hoffman. A method for globally minimizing concave functions over convex sets. Mathematical Programming, 22: 22\u201332, 1981.","journal-title":"Mathematical Programming"},{"key":"141359_CR30","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1007\/BF01580678","volume":"10","author":"R. Horst","year":"1976","unstructured":"R. Horst. An algorithm for nonconvex programming problems. Mathematical Programming, 10: 312\u2013321, 1976.","journal-title":"Mathematical Programming"},{"key":"141359_CR31","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF01720068","volume":"6","author":"R. Horst","year":"1984","unstructured":"R. Horst. On the global minimization of concave functions\u2013introduction and survey. OR Spektrum, 6: 195\u2013205, 1984.","journal-title":"OR Spektrum"},{"key":"141359_CR32","volume-title":"Introduction to Global Optimization","author":"R. Horst","year":"1995","unstructured":"R. Horst, P. M. Pardalos, and N. V. Thoai. Introduction to Global Optimization. Nonconvex Optimization and its Applications. Kluwer Academic Publishers, Norwell, MA, 1995."},{"key":"141359_CR33","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03199-5","volume-title":"Global Optimization: Deterministic Approaches","author":"R. Horst","year":"1996","unstructured":"R. Horst and H. Tuy. Global Optimization: Deterministic Approaches. Springer\u2013Verlag, Berlin, third edition, 1996.","edition":"third edition"},{"key":"141359_CR34","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/BF01594938","volume":"50","author":"N. V. Horst","year":"1991","unstructured":"N. V. Horst, R., Thoai and H. P. Benson. Concave minimization via conical partitions and polyhedral outer approximation. Mathematical Programming, 50: 259\u2013274, 1991.","journal-title":"Mathematical Programming"},{"key":"141359_CR35","volume-title":"Optimization Subroutine Library Guide and Reference Release 2","author":"IBM.","year":"1991","unstructured":"IBM. Optimization Subroutine Library Guide and Reference Release 2. International Business Machines Corporation, Kingston, NY, third edition, July 1991.","edition":"third edition"},{"issue":"3","key":"141359_CR36","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1287\/moor.12.3.544","volume":"12","author":"B. Kalantari","year":"1987","unstructured":"B. Kalantari and J. B. Rosen. An algorithm for global minimization of linearly constrained convex quadratic functions. Mathematics of Operations Research, 12(3): 544\u2013561, 1987.","journal-title":"Mathematics of Operations Research"},{"key":"141359_CR37","first-page":"479","volume-title":"Survey of Mathematical Programming, Proceedings of the Ninth International Mathematical Programming Symposium","author":"S. L. Krynski","year":"1976","unstructured":"S. L. Krynski. Minimization of a concave function under linear constraints (modification of tuy's method). In, Survey of Mathematical Programming, Proceedings of the Ninth International Mathematical Programming Symposium, Mathematicl Programming Society, Budapest, 1976, volume 1, pp. 479\u2013493, Amsterdam, 1979."},{"issue":"3","key":"141359_CR38","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF01096771","volume":"3","author":"B. W. Lamar","year":"1993","unstructured":"B. W. Lamar. An improved branch and bound algorithm for minimum concave cost network flow problems. Journal of Global Optimization, 3(3): 261\u2013287, 1993.","journal-title":"Journal of Global Optimization"},{"key":"141359_CR39","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1287\/mnsc.9.4.586","volume":"9","author":"E. L. Lawler","year":"1963","unstructured":"E. L. Lawler. The quadratic assignment problem. Management Science, 9: 586\u2013699, 1963.","journal-title":"Management Science"},{"key":"141359_CR40","volume-title":"Planning of chemical process networks via global concave minimization","author":"M. L. Liu","year":"1996","unstructured":"M. L. Liu and N. V. Sahinidis and J. P. Shectman. Planning of chemical process networks via global concave minimization. In, I. E. Grossmann (ed.), Global Optimization in Engineering Design, Boston, MA, 1996."},{"key":"141359_CR41","doi-asserted-by":"crossref","unstructured":"O. L. Mangasarian. Characterization of linear complementarity problems as linear programs. {tiMathematical Programming Study}, 7: 74\u201387, 1978.","DOI":"10.1007\/BFb0120783"},{"key":"141359_CR42","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1287\/opre.21.1.247","volume":"21","author":"T. H. Matheiss","year":"1973","unstructured":"T. H. Matheiss. An algorithm for determining unrelevant constraints and all vertices in systems of linear inequalities. Operations Research, 21: 247\u2013260, 1973.","journal-title":"Operations Research"},{"key":"141359_CR43","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1287\/moor.5.2.167","volume":"5","author":"T. H. Matheiss","year":"1980","unstructured":"T. H. Matheiss and D. S. Rubin. A survey and comparison of methods for finding all vertices of convex polyhedral sets. Mathematics of Operations Research, 5: 167\u2013185, 1980.","journal-title":"Mathematics of Operations Research"},{"key":"141359_CR44","unstructured":"G. P. McCormick. Attempts to calculate global solutions of problems that may have local minima. In, F. A. Lootsma (ed.), Numerical Methods for Non\u2013Linear Optimization, pp. 209\u2013221, New York, 1972."},{"key":"141359_CR45","unstructured":"K. Moshirvaziri. Personal Communication, 1994."},{"key":"141359_CR46","doi-asserted-by":"crossref","unstructured":"K. Moshirvaziri. A generalization of the construction of test problems for nonconvex optimization. {tiJournal of Global Optimization}, 5: 21\u201334, 1994.","DOI":"10.1007\/BF01097001"},{"issue":"3","key":"141359_CR47","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1016\/0041-5553(82)90145-8","volume":"22","author":"B. M. Mukhamediev","year":"1982","unstructured":"B. M. Mukhamediev. Approximate methods of solving concave programming problems. USSR Computational Mathematics and Mathematical Physics, 22(3): 238\u2013245, 1982.","journal-title":"USSR Computational Mathematics and Mathematical Physics"},{"key":"141359_CR48","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF02592948","volume":"39","author":"K. G. Murty","year":"1987","unstructured":"K. G. Murty and S. N. Kabadi. Some NP\u2013complete problems in quadratic and nonlinear programming. {tiMathematical Programming}, 39: 117\u2013129, 1987.","journal-title":"{tiMathematical Programming}"},{"key":"141359_CR49","volume-title":"Integer and Separable Programming Techniques for Large\u2013Scale Global Optimization Problems","author":"P. M. Pardalos","year":"1985","unstructured":"P. M. Pardalos. Integer and Separable Programming Techniques for Large\u2013Scale Global Optimization Problems. PhD thesis, Computer Science Department, University of Minnesota, Minneapolis, 1985."},{"key":"141359_CR50","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1137\/1028106","volume":"28","author":"P. M. Pardalos","year":"1986","unstructured":"P. M. Pardalos and J. B. Rosen. Methods for global concave minimization: A bibliographic survey. SIAM Review, 28: 367\u2013379, 1986.","journal-title":"SIAM Review"},{"key":"141359_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0000035","volume-title":"Constrained Global Optimization: Algorithms and Applications","author":"P. M. Pardalos","year":"1987","unstructured":"P. M. Pardalos and J. B. Rosen. Constrained Global Optimization: Algorithms and Applications. Number 268 in Lecture Notes in Computer Science. Springer\u2013Verlag, Berlin\u2013Heidelberg, 1987."},{"key":"141359_CR52","volume-title":"Parallel Algorithms for Constrained Optimization","author":"A. T. Phillips","year":"1988","unstructured":"A. T. Phillips. Parallel Algorithms for Constrained Optimization. PhD thesis, University of Minnesota, Minneapolis, 1988."},{"key":"141359_CR53","series-title":"Technical Report","volume-title":"A parallel algorithm for constrained concave quadratic global minimization","author":"A. T. Phillips","year":"1987","unstructured":"A. T. Phillips and J. B. Rosen. A parallel algorithm for constrained concave quadratic global minimization. Technical Report 87\u201348, Computer Science Department, Institute of Technology, University of Minnesota, Minneapolis, 1987."},{"key":"141359_CR54","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF01589415","volume":"42","author":"A. T. Phillips","year":"1988","unstructured":"A. T. Phillips and J. B. Rosen. A parallel algorithm for constrained concave quadratic global minimization. Mathematical Programming, 42: 421\u2013448, 1988.","journal-title":"Mathematical Programming"},{"key":"141359_CR55","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1002\/1520-6750(199008)37:4<499::AID-NAV3220370405>3.0.CO;2-9","volume":"37","author":"A. T. Phillips","year":"1990","unstructured":"A. T. Phillips and J. B. Rosen. Guaranteed \u03be\u2013approximate solution for indefinite quadratic global minimization. Naval Research Logistics, 37: 499\u2013514, 1990.","journal-title":"Naval Research Logistics"},{"key":"141359_CR56","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF02283689","volume":"25","author":"A. T. Phillips","year":"1990","unstructured":"A. T. Phillips and J. B. Rosen. A parallel algorithm for partially separable non\u2013convex global minimization: Linear constraints. Annals of Operations Research, 25: 101\u2013118, 1990.","journal-title":"Annals of Operations Research"},{"key":"141359_CR57","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF01100241","volume":"3","author":"A. T. Phillips","year":"1992","unstructured":"A. T. Phillips and J. B. Rosen. Sufficient conditions for solving linearly constrained separable concave global minimization problems. Journal of Global Optimization, 3: 79\u201394, 1992.","journal-title":"Journal of Global Optimization"},{"issue":"4","key":"141359_CR58","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF01096682","volume":"5","author":"A. T. Phillips","year":"1994","unstructured":"A. T. Phillips and J. B. Rosen. Computational comparison of two methods for constrained global optimization. Journal of Global Optimization, 5(4): 325\u2013332, 1994.","journal-title":"Journal of Global Optimization"},{"issue":"3","key":"141359_CR59","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BF00171828","volume":"2","author":"J. B. Phillips","year":"1992","unstructured":"J. B. Phillips, A. T., Rosen and M. van Vliet. A parallel stochastic method for the constrained concave global minimization problem. Journal of Global Optimization, 2(3): 243\u2013258, 1992.","journal-title":"Journal of Global Optimization"},{"key":"141359_CR60","doi-asserted-by":"crossref","first-page":"680","DOI":"10.1287\/opre.17.4.680","volume":"17","author":"M. Raghavachari","year":"1969","unstructured":"M. Raghavachari. On connections between zero\u2013one integer programming and concave programming under linear constraints. Operations Research, 17: 680\u2013684, 1969.","journal-title":"Operations Research"},{"key":"141359_CR61","volume-title":"Convex Analysis","author":"R. T. Rockafellar","year":"1972","unstructured":"R. T. Rockafellar. Convex Analysis. Princeton University Press, Princeton, second edition, 1972.","edition":"second edition"},{"issue":"2","key":"141359_CR62","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1287\/moor.8.2.215","volume":"8","author":"J. B. Rosen","year":"1983","unstructured":"J. B. Rosen. Global minimization of a linearly constrained concave function by partition of feasible domain. Mathematics of Operations Research, 8(2): 215\u2013230, 1983.","journal-title":"Mathematics of Operations Research"},{"key":"141359_CR63","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF01580581","volume":"34","author":"J. B. Rosen","year":"1986","unstructured":"J. B. Rosen and P. M. Pardalos. Global minimization of large\u2013scale constrained concave quadratic problems by separable programming. Mathematical Programming, 34: 163\u2013174, 1986.","journal-title":"Mathematical Programming"},{"key":"141359_CR64","series-title":"Technical Report","volume-title":"A parallel stochastic method for the constrained concave global minimization problem","author":"J. B. Rosen","year":"1987","unstructured":"J. B. Rosen and M. van Vliet. A parallel stochastic method for the constrained concave global minimization problem. Technical Report 87\u201331, Computer Science Department, Institute of Technology, University of Minnesota, Minneapolis, 1987."},{"issue":"5","key":"141359_CR65","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1016\/0098-1354(94)00097-2","volume":"19","author":"H. S. Ryoo","year":"1995","unstructured":"H. S. Ryoo and N. V. Sahinidis. Global optimization of nonconvex nlps and minlps with applications in process design. Computers & Chemical Engineering, 19(5): 551\u2013566, 1995.","journal-title":"Computers & Chemical Engineering"},{"issue":"2","key":"141359_CR66","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF00138689","volume":"8","author":"H. S. Ryoo","year":"1996","unstructured":"H. S. Ryoo and N. V. Sahinidis. A branch-and-reduce approach to global optimization. Journal of Global Optimization, 8(2): 107\u2013138, March 1996.","journal-title":"Journal of Global Optimization"},{"key":"141359_CR67","series-title":"Research Report","volume-title":"Accelerating branch\u2013and\u2013bound in continuous optimization","author":"N. V. Sahinidis","year":"1992","unstructured":"N. V. Sahinidis. Accelerating branch\u2013and\u2013bound in continuous optimization. Research Report UILU ENG 92\u20134031, University of Illinois, Urbana, 1992."},{"issue":"2","key":"141359_CR68","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF00138693","volume":"8","author":"N. V. Sahinidis","year":"1996","unstructured":"N. V. Sahinidis. Baron: A general purpose global optimization software package. Journal of Global Optimization, 8(2): 201\u2013205, March 1996.","journal-title":"Journal of Global Optimization"},{"issue":"Supp.1","key":"141359_CR69","doi-asserted-by":"crossref","first-page":"S127","DOI":"10.1287\/opre.40.1.S127","volume":"40","author":"N. V. Sahinidis","year":"1992","unstructured":"N. V. Sahinidis and I. E. Grossmann. Reformulation of the multiperiod MILP model for capacity expansion of chemical processes. Operations Research, 40, Supp. No. 1: S127\u2013S144, 1992.","journal-title":"Operations Research"},{"key":"141359_CR70","doi-asserted-by":"crossref","first-page":"1049","DOI":"10.1016\/0098-1354(89)87046-2","volume":"13","author":"N. V. Sahinidis","year":"1989","unstructured":"N. V. Sahinidis, I. E. Grossmann, R. E. Fornari, and M. Chathrathi. Optimization model for long range planning in the chemical industry. Computers and Chemical Engineering, 13: 1049\u20131063, 1989.","journal-title":"Computers and Chemical Engineering"},{"key":"141359_CR71","doi-asserted-by":"crossref","unstructured":"J. P. Shectman and N. V. Sahinidis. A finite algorithm for global minimization of separable concave programs. In, C. A. Floudas and P. M. Pardalos (eds.), State of the Art in Global Optimization: Computational Methods and Applications, Boston, MA, 1996.","DOI":"10.1007\/978-1-4613-3437-8_20"},{"issue":"4","key":"141359_CR72","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/BF00122429","volume":"2","author":"H. D. Sherali","year":"1992","unstructured":"H. D. Sherali and A. Alameddine. A new reformulation\u2013linearization technique for bilinear programming problems. Journal of Global Optimization, 2(4): 379\u2013410, 1992.","journal-title":"Journal of Global Optimization"},{"issue":"1","key":"141359_CR73","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01100203","volume":"7","author":"H. D. Sherali","year":"1995","unstructured":"H. D. Sherali and C. H. Tuncbilek. A reformulation-convexification approach for solving nonconvex quadratic programming problems. Journal of Global Optimization, 7(1): 1\u201331, July 1995.","journal-title":"Journal of Global Optimization"},{"key":"141359_CR74","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1287\/opre.22.2.373","volume":"22","author":"R. M. Soland","year":"1974","unstructured":"R. M. Soland. Optimal facility location with concave costs. Operations Research, 22: 373\u2013382, 1974.","journal-title":"Operations Research"},{"key":"141359_CR75","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/BF01299207","volume":"3","author":"U. H. Suhl","year":"1994","unstructured":"U. H. Suhl and R. Szymanski. Supernode processing of mixed\u2013integer models. Computational Optimization and Applications, 3: 317\u2013331, 1994.","journal-title":"Computational Optimization and Applications"},{"issue":"2","key":"141359_CR76","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1287\/moor.16.2.390","volume":"16","author":"N. V. Thakur","year":"1990","unstructured":"N. V. Thakur. Domain contraction in nonlinear programming: Minimizing a quadratic concave function over a polyhedron. Mathematics of Operations Research, 16(2): 390\u2013407, 1990.","journal-title":"Mathematics of Operations Research"},{"key":"141359_CR77","first-page":"106","volume":"2","author":"T. V. Thieu","year":"1980","unstructured":"T. V. Thieu. Relationship between bilinear programming and concave programming. Acta Mathematica Vietnamica, 2: 106\u2013113, 1980.","journal-title":"Acta Mathematica Vietnamica"},{"key":"141359_CR78","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1287\/moor.5.4.556","volume":"5","author":"N. V. Thoai","year":"1980","unstructured":"N. V. Thoai and H. Tuy. Convergent algorithms for minimizing a concave function. Mathematics of Operations Research, 5: 556\u2013566, 1980.","journal-title":"Mathematics of Operations Research"},{"key":"141359_CR79","doi-asserted-by":"crossref","unstructured":"N. V. Thoai and H. Tuy. Solving the linear complementarity problem through concave programming. {tiUSSR Computational Mathematics and Mathematical Physics}, 23(3): 55\u201359, 1983.","DOI":"10.1016\/S0041-5553(83)80101-3"},{"key":"141359_CR80","first-page":"1437","volume":"5","author":"H. Tuy","year":"1964","unstructured":"H. Tuy. Concave programming under linear constraints. Soviet Mathematics, 5: 1437\u20131440, 1964.","journal-title":"Soviet Mathematics"},{"issue":"1","key":"141359_CR81","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF00120663","volume":"1","author":"H. Tuy","year":"1991","unstructured":"H. Tuy. Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms. Journal of Global Optimization, 1(1): 23\u201336, 1991.","journal-title":"Journal of Global Optimization"},{"key":"141359_CR82","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF01580762","volume":"41","author":"H. Tuy","year":"1988","unstructured":"H. Tuy and R. Horst. Convergence and restart in branch\u2013and\u2013bound algorithms for global optimization. application to concave minimization and DC optimization problems. Mathematical Programming, 41: 161\u2013183, 1988.","journal-title":"Mathematical Programming"},{"key":"141359_CR83","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/moor.10.3.498","volume":"10","author":"T. V. Tuy","year":"1985","unstructured":"T. V. Tuy, H., Thieu and Thai N. Q. A conical algorithm for globally minimizing a concave function over a closed convex set. Mathematics of Operations Research, 10: 498\u2013514, 1985.","journal-title":"Mathematics of Operations Research"},{"key":"141359_CR84","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/BF01096414","volume":"3","author":"V. Visweswaran","year":"1993","unstructured":"V. Visweswaran and C. A. Floudas. New properties and computational improvement of the gop algorithm for problems with quadratic objective functions and constraints. Journal of Global Optimization, 3: 439\u2013462, 1993.","journal-title":"Journal of Global Optimization"},{"key":"141359_CR85","doi-asserted-by":"crossref","unstructured":"P. B. Zwart. Computational aspects on the use of cutting planes in global optimization. In, Proceedings of the 1971 Annual Conference of the ACM, Association for Computing Machinery, pp. 457\u2013465, 1971.","DOI":"10.1145\/800184.810515"},{"key":"141359_CR86","doi-asserted-by":"crossref","first-page":"1260","DOI":"10.1287\/opre.21.6.1260","volume":"21","author":"P. B. Zwart","year":"1973","unstructured":"P. B. Zwart. Nonlinear programming: Counterexamples to global optimization algorithms. Operations Research, 21: 1260\u20131266, 1973.","journal-title":"Operations Research"},{"key":"141359_CR87","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1287\/opre.22.3.602","volume":"22","author":"P. B. Zwart","year":"1974","unstructured":"P. B. Zwart. Global maximization of a convex function with linear inequality constraints. Operations Research, 22: 602\u2013609, 1974.","journal-title":"Operations Research"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008241411395.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008241411395\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008241411395.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T10:39:43Z","timestamp":1751366383000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008241411395"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":87,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["141359"],"URL":"https:\/\/doi.org\/10.1023\/a:1008241411395","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}