{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:28:53Z","timestamp":1725488933890},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540699941"},{"type":"electronic","value":"9783540699958"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-69995-8_82","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T12:28:21Z","timestamp":1186748901000},"page":"515-520","source":"Crossref","is-referenced-by-count":3,"title":["A Branch and Bound Algorithm Based on DC Programming and DCA for Strategic Capacity Planning in Supply Chain Design for a New Market Opportunity"],"prefix":"10.1007","author":[{"given":"Nguyen Canh","family":"Nam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thi Hoai","family":"Le An","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pham Dinh","family":"Tao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"82_CR1","first-page":"1216","volume":"27","author":"T. H. An Le","year":"1999","unstructured":"Le Thi Hoai An, Pham Dinh Tao and Le Dung Muu (1999) Exact Penalty in DC Programming. Vietnam Journal of Mathematics 27:2, pp 1216\u20131231.","journal-title":"Vietnam Journal of Mathematics"},{"key":"82_CR2","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1080\/02331930108844555","volume":"50","author":"T. H. An Le","year":"2001","unstructured":"Le Thi Hoai An, Pham Dinh Tao (2001) A continuous approach for globally solving linearly constrained 0\u20131 programming problems, Journal of Global Optimization 50, pp. 93\u2013120.","journal-title":"Journal of Global Optimization"},{"issue":"1","key":"82_CR3","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1137\/S1052623498342794","volume":"14","author":"T. H. An Le","year":"2003","unstructured":"Le Thi Hoai An, Pham Dinh Tao (2003) Large Scale Molecular Optimization From Distance Matrices by a DC Optimization Approach. SIAM Journal on Optimization, Vol. 14, No 1 (2003), pp. 77\u2013116.","journal-title":"SIAM Journal on Optimization"},{"key":"82_CR4","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10479-004-5022-1","volume":"133","author":"T. H. An Le","year":"2005","unstructured":"Le Thi Hoai An, Pham Dinh Tao (2005) The DC (Difference of Convex functions) Programming and DCA revisited with DC models of real world nonconvex optimization problem. Annals of Operations Research 133: 23\u201346.","journal-title":"Annals of Operations Research"},{"key":"82_CR5","unstructured":"Satyaveer S. Chauhan, Rakesh Nagi and Jean-Marie Proth (2002) Strategic Capacity Planning in Supply Chain Design for a New Market Opportunity. INRIA Research Report, RR-4658."},{"key":"82_CR6","unstructured":"Satyaveer S. Chauhan (2003) Cha\u00eenes d\u2019approvisionnement: approches strat\u00e9gique et tactique. Th\u00e8se de Doctorat, Universit\u00e9 de Metz."},{"issue":"1","key":"82_CR7","first-page":"289","volume":"22","author":"P. D. Tao","year":"1997","unstructured":"Pham Dinh Tao, Le Thi Hoai An (1997) Convex analysis approach to DC programming: Theory, Algorithms and Applications. Acta Mathematica Vietnamica, dedicated to Professor Hoang Tuy on the occasion of his 70th birthday 22:1, pp 289\u2013355.","journal-title":"Acta Mathematica Vietnamica, dedicated to Professor Hoang Tuy on the occasion of his 70th birthday"},{"key":"82_CR8","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1137\/S1052623494274313","volume":"8","author":"P. D. Tao","year":"1998","unstructured":"Pham Dinh Tao and Le Thi Hoai An (1998) DC optimization algorithms for solving the trust region subproblem. SIAM J.Optimization 8:476\u2013505.","journal-title":"SIAM J.Optimization"}],"container-title":["Operations Research Proceedings 2006"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69995-8_82","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T04:45:00Z","timestamp":1550724300000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69995-8_82"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540699941","9783540699958"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69995-8_82","relation":{},"subject":[],"published":{"date-parts":[[2007]]}}}