{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T09:46:15Z","timestamp":1751881575971},"reference-count":21,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1995,9,1]],"date-time":"1995-09-01T00:00:00Z","timestamp":809913600000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[1995,9]]},"DOI":"10.1016\/0167-6377(95)00037-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:14:29Z","timestamp":1027624469000},"page":"99-106","source":"Crossref","is-referenced-by-count":16,"title":["Canonical DC programming problem: Outer approximation methods revisited"],"prefix":"10.1016","volume":"18","author":[{"given":"Hoang","family":"Tuy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(95)00037-X_BIB1","series-title":"Recent Advances in Global Optimization","first-page":"152","article-title":"A new cutting plane algorithm for a class of reverse convex 0\u20131 integer programs","author":"BenSaad","year":"1992"},{"key":"10.1016\/0167-6377(95)00037-X_BIB2","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF02283685","article-title":"A level set algorithm for a class of reverse convex programs","volume":"25","author":"BenSaad","year":"1990","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/0167-6377(95)00037-X_BIB3","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF01097005","article-title":"Comments on a reverse convex programming algorithm","volume":"5","author":"BenSaad","year":"1994","journal-title":"J. Global Optim."},{"key":"10.1016\/0167-6377(95)00037-X_BIB4","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/0167-6377(91)90042-N","article-title":"On-line and off-line vertex enumeration by adjacency lists","volume":"10","author":"Chen","year":"1991","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0167-6377(95)00037-X_BIB5","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BF01386389","article-title":"Newton's method for convex programming and Tchebycheff approximation","volume":"1","author":"Cheney","year":"1959","journal-title":"Numer. Math."},{"key":"10.1016\/0167-6377(95)00037-X_BIB6","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":"Math. Oper. Res."},{"key":"10.1016\/0167-6377(95)00037-X_BIB7","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/0377-2217(90)90250-F","article-title":"A finite cutting plane method for solving linear programs with an additional reverse convex constraint","volume":"44","author":"F\u00fcl\u00f6p","year":"1990","journal-title":"European J. Oper. Res."},{"key":"10.1016\/0167-6377(95)00037-X_BIB8","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF01442883","article-title":"Reverse convex programming","volume":"6","author":"Hillestad","year":"1980","journal-title":"Appl. Math. Optim."},{"key":"10.1016\/0167-6377(95)00037-X_BIB9","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1007\/BF01589330","article-title":"A method for globally minimizing concave functions over convex sets","volume":"20","author":"Hoffman","year":"1981","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(95)00037-X_BIB10","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0167-6377(88)90071-5","article-title":"On finding new vertices and redundant constraints in cutting plane algorithms for global optimization","volume":"7","author":"Horst","year":"1988","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0167-6377(95)00037-X_BIB11","series-title":"Global optimization","author":"Horst","year":"1993"},{"key":"10.1016\/0167-6377(95)00037-X_BIB12","first-page":"703","article-title":"The cutting plane method for solving convex programs","volume":"8","author":"Kelley","year":"1960","journal-title":"J. SIAM"},{"key":"10.1016\/0167-6377(95)00037-X_BIB13","series-title":"Convex analysis","author":"Rockafellar","year":"1970"},{"key":"10.1016\/0167-6377(95)00037-X_BIB14","first-page":"21","article-title":"An outer approximation method for globally minimizing a concave function over a compact convex set","volume":"8","author":"Thieu","year":"1983","journal-title":"Acta Math. Vietnam."},{"key":"10.1016\/0167-6377(95)00037-X_BIB15","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1080\/02331938808843381","article-title":"A modified version of Tuy's method for solving DC programming problems","volume":"19","author":"Thoai","year":"1988","journal-title":"Optimization"},{"key":"10.1016\/0167-6377(95)00037-X_BIB16","first-page":"1437","article-title":"Concave programming under linear constraints","volume":"5","author":"Tuy","year":"1964","journal-title":"Soviet Math."},{"key":"10.1016\/0167-6377(95)00037-X_BIB17","first-page":"3","article-title":"On outer approximation methods for solving concave minimization problems","volume":"8","author":"Tuy","year":"1983","journal-title":"Acta Math. Vietnam."},{"key":"10.1016\/0167-6377(95)00037-X_BIB18","series-title":"Fermat Days 1985: Mathematics for Optimization","first-page":"137","article-title":"A general deterministic approach to global optimization via DC programming","author":"Tuy","year":"1986"},{"key":"10.1016\/0167-6377(95)00037-X_BIB19","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/BF00938217","article-title":"Convex programs with an additional reverse convex constraint","volume":"52","author":"Tuy","year":"1987","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/0167-6377(95)00037-X_BIB20","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 DC-optimization","volume":"41","author":"Tuy","year":"1988","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(95)00037-X_BIB21","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1287\/opre.15.1.147","article-title":"The supporting hyperplane method for unimodal programming","volume":"15","author":"Veinott","year":"1967","journal-title":"Oper. Res."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779500037X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779500037X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T04:53:35Z","timestamp":1555563215000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016763779500037X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,9]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,9]]}},"alternative-id":["016763779500037X"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(95)00037-x","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1995,9]]}}}