{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T09:26:40Z","timestamp":1751880400228},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1991,7,1]],"date-time":"1991-07-01T00:00:00Z","timestamp":678326400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1991,7]]},"DOI":"10.1007\/bf01586935","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T12:19:31Z","timestamp":1114690771000},"page":"229-245","source":"Crossref","is-referenced-by-count":21,"title":["Normal conical algorithm for concave minimization over polytopes"],"prefix":"10.1007","volume":"51","author":[{"given":"Hoang","family":"Tuy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"Minimization of a concave function on a bounded convex polyhedron","author":"S. Bali","year":"1973","unstructured":"S. Bali, \u201cMinimization of a concave function on a bounded convex polyhedron,\u201d Ph.D. Dissertation, University of California (Los Angeles, A, 1973)."},{"key":"CR2","volume-title":"Metody Pogrujeniia v Zadatchak Optimizatsii","author":"V.P. Bulatov","year":"1977","unstructured":"V.P. Bulatov,Metody Pogrujeniia v Zadatchak Optimizatsii (Nauka, Sibirskoe Otdelenie, Novosibirsk, 1977)."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1287\/moor.13.3.479","volume":"13","author":"M. Hamami","year":"1988","unstructured":"M. Hamami and S.E. Jacobsen, \u201cExhaustive nondegenerate conical processes for concave minimization on convex polytopes,\u201dMathematics of Operations Research 13 (1988) 479\u2013487.","journal-title":"Mathematics of Operations Research"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1007\/BF01580678","volume":"10","author":"R. Horst","year":"1976","unstructured":"R. Horst, \u201cAn algorithm for nonconvex programming problems,\u201dMathematical Programming 10 (1976) 312\u2013321.","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":"R. Horst, \u201cOn the global minimization of concave functions: Introduction and survey,\u201dOperations Research Spektrum 6 (1984) 195\u2013205.","journal-title":"Operations Research Spektrum"},{"key":"CR6","unstructured":"R. Horst and Ng.V. Thoai, \u201cImplementation, modification and comparison of some algorithms for concave minimization problems,\u201d Preprint, Department of Mathematics, University of Trier (1988), to appear in:Computing."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01442106","volume":"7","author":"S.E. Jacobsen","year":"1981","unstructured":"S.E. Jacobsen, \u201cConvergence of a Tuy-type algorithm for concave minimization subject to linear constraints,\u201dApplied Mathematics and Optimization 7 (1981) 1\u20139.","journal-title":"Applied Mathematics and Optimization"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1137\/1028106","volume":"26","author":"P.M. Pardalos","year":"1986","unstructured":"P.M. Pardalos and J.B. Rosen, \u201cMethods for global concave minimization: a bibliographic survey,\u201dSIAM Review 26 (1986) 367\u2013379.","journal-title":"SIAM Review"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1287\/moor.5.4.556","volume":"5","author":"Ng.V. Thoai","year":"1980","unstructured":"Ng.V. Thoai and H. Tuy, \u201cConvergent algorithm for minimizing a concave function,\u201dMathematics of Operations Research 5 (1980) 556\u2013566.","journal-title":"Mathematics of Operations Research"},{"key":"CR10","unstructured":"Ng.V. Thoai and J. de Vries, \u201cNumerical experiments on concave minimization algorithms,\u201d to appear in:Methods of Operations Research."},{"key":"CR11","first-page":"32","volume":"158","author":"H. Tuy","year":"1964","unstructured":"H. Tuy, \u201cVognutoe programmirovaniie pri lineinyk ogranitchenyakh,\u201dDoklady AN SSSR 158 (1964) 32\u201335. [Translated as: \u201cConcave programming under linear constraints,\u201dSoviet Mathematics 5 (1964) 1437\u20131440.]","journal-title":"Doklady AN SSSR"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/moor.10.3.498","volume":"10","author":"H. Tuy","year":"1985","unstructured":"H. Tuy, T.V. Thieu and Ng.Q. Thai, \u201cA conical algorithm for globally minimizing a concave function over a closed convex set,\u201dMathematics of Operations Research 10 (1985) 498\u2013514.","journal-title":"Mathematics of Operations Research"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1080\/02331938708843294","volume":"18","author":"H. Tuy","year":"1987","unstructured":"H. Tuy, V. Khachaturov and S. Utkin, \u201cA class of exhaustive cone splitting procedures in conical algorithms for concave minimization,\u201dOptimization 18 (1987) 791\u2013808.","journal-title":"Optimization"},{"key":"CR14","volume-title":"Fermat Days 1985: Mathematics for Optimization. Mathematics Studies Series","author":"H. Tuy","year":"1986","unstructured":"H. Tuy, \u201cA general deterministic approach to global optimization via D.C. programming,\u201d in: J.B. Hiriari-Urruty, ed.,Fermat Days 1985: Mathematics for Optimization. Mathematics Studies Series (North-Holland, Amsterdam, 1986)."},{"key":"CR15","unstructured":"H. Tuy, \u201cOn polyhedral annexation method for concave minimization,\u201d submitted for publication."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF01580762","volume":"41","author":"H. Tuy","year":"1988","unstructured":"H. Tuy and R. Horst, \u201cConvergence and restart in branch and bound algorithms for global optimization algorithms,\u201dMathematical Programming 41 (1988) 161\u2013184.","journal-title":"Mathematical Programming"},{"key":"CR17","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, \u201cNonlinear Programming: counterexamples to two global optimization algorithms,\u201dOperations Research 21 (1973) 1260\u20131266.","journal-title":"Operations Research"},{"key":"CR18","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, \u201cGlobal maximization of a convex function with linear inequality constraints,\u201dOperations Research 22 (1974) 602\u2013609.","journal-title":"Operations Research"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01586935.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01586935\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01586935","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:31:34Z","timestamp":1556897494000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01586935"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,7]]},"references-count":18,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1991,7]]}},"alternative-id":["BF01586935"],"URL":"https:\/\/doi.org\/10.1007\/bf01586935","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,7]]}}}