{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:12:08Z","timestamp":1742919128462,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030218027"},{"type":"electronic","value":"9783030218034"}],"license":[{"start":{"date-parts":[[2019,6,15]],"date-time":"2019-06-15T00:00:00Z","timestamp":1560556800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-21803-4_34","type":"book-chapter","created":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T22:03:24Z","timestamp":1560549804000},"page":"330-340","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Parallel DC Cutting Plane Algorithms for\u00a0Mixed Binary Linear Program"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9993-3681","authenticated-orcid":false,"given":"Yi-Shuai","family":"Niu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"You","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wen-Zhuo","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,15]]},"reference":[{"key":"34_CR1","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E Balas","year":"1993","unstructured":"Balas, E., Ceria, S., Cornu\u00e9jols, G.: A lift-and-project cutting plane algorithm for mixed 0\u20131 programs. Math. Program. 58, 295\u2013324 (1993)","journal-title":"Math. Program."},{"issue":"1","key":"34_CR2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10107-006-0086-0","volume":"112","author":"G Cornu\u00e9jols","year":"2008","unstructured":"Cornu\u00e9jols, G.: Valid inequalities for mixed integer linear programs. Math. Program. 112(1), 3\u201344 (2008)","journal-title":"Math. Program."},{"key":"34_CR3","unstructured":"Gurobi 8.1.0. \n                    http:\/\/www.gurobi.com"},{"issue":"2","key":"34_CR4","first-page":"169","volume":"27","author":"HA Thi Le","year":"1999","unstructured":"Le Thi, H.A., Pham, D.T., Le Dung, M.: Exact penalty in dc programming. Vietnam J. Math. 27(2), 169\u2013178 (1999)","journal-title":"Vietnam J. Math."},{"key":"34_CR5","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10479-004-5022-1","volume":"133","author":"HA Thi Le","year":"2005","unstructured":"Le Thi, H.A., Pham, D.T.: The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems. Ann. Oper. Res. 133, 23\u201346 (2005)","journal-title":"Ann. Oper. Res."},{"issue":"3\u20134","key":"34_CR6","first-page":"271","volume":"23","author":"HA Thi Le","year":"2009","unstructured":"Le Thi, H.A., Nguyen, Q.T., Nguyen, H.T., Pham, D.T.: Solving the earliness tardiness scheduling problem by DC programming and DCA. Math. Balk. 23(3\u20134), 271\u2013288 (2009)","journal-title":"Math. Balk."},{"issue":"4","key":"34_CR7","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/s10287-009-0098-3","volume":"6","author":"HA Thi Le","year":"2009","unstructured":"Le Thi, H.A., Moeini, M., Pham, D.T.: Portfolio selection under downside risk measures and cardinality constraints based on DC programming and DCA. Comput. Manag. Sci. 6(4), 459\u2013475 (2009)","journal-title":"Comput. Manag. Sci."},{"issue":"3","key":"34_CR8","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1007\/s10898-011-9765-3","volume":"52","author":"HA Thi Le","year":"2012","unstructured":"Le Thi, H.A., Pham, D.T., Huynh, V.N.: Exact penalty and error bounds in dc programming. J. Glob. Optim. 52(3), 509\u2013535 (2012)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"34_CR9","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10107-018-1235-y","volume":"169","author":"HA Thi Le","year":"2018","unstructured":"Le Thi, H.A., Pham, D.T.: DC programming and DCA: thirty years of developments. Math. Program. 169(1), 5\u201368 (2018)","journal-title":"Math. Program."},{"key":"34_CR10","doi-asserted-by":"publisher","unstructured":"Ndiaye, B.M., Le Thi, H.A., Pham, D.T., Niu, Y.S.: DC programming and DCA for large-scale two-dimensional packing problems. In: Pan, J.S., Chen, S.M., Nguyen, N.T. (eds.) Intelligent Information and Database Systems, LNCS, vol. 7197, pp. 321\u2013330, Springer, Berlin (2012). \n                    https:\/\/doi.org\/10.1007\/978-3-642-28490-8_34","DOI":"10.1007\/978-3-642-28490-8_34"},{"key":"34_CR11","unstructured":"Nguyen, V.V.: M\u00e9thodes exactes pour l\u2019optimisation DC poly\u00e9drale en variables mixtes 0-1 bas\u00e9es sur DCA et des nouvelles coupes. Ph.D. thesis, INSA de Rouen (2006)"},{"key":"34_CR12","unstructured":"Nguyen, Q.T.: Approches locales et globales bas\u00e9es sur la programmation DC et DCA pour des probl\u00e8mes combinatoires en variables mixtes 0\u20131, applications \u00e0 la planification op\u00e9rationnelle. These de doctorat dirig\u00e9e par Le Thi H.A, Informatique Metz (2010)"},{"key":"34_CR13","doi-asserted-by":"publisher","unstructured":"Niu, Y.S., Pham, D.T.: A DC Programming Approach for Mixed-Integer Linear Programs. In: Le Thi, H.A., Bouvry, P., Pham, D.T. (eds.) Modelling, Computation and Optimization in Information Systems and Management Sciences (MCO 2008), Communications in Computer and Information Science, vol. 14, pp. 244\u2013253. Springer, Berlin (2008). \n                    https:\/\/doi.org\/10.1007\/978-3-540-87477-5_27","DOI":"10.1007\/978-3-540-87477-5_27"},{"key":"34_CR14","unstructured":"Niu, Y.S.: Programmation DC & DCA en Optimisation Combinatoire et Optimisation Polynomiale via les Techniques de SDP\u2013Codes et Simulations Num\u00e9riques. Ph.D. thesis, INSA-Rouen, France (2010)"},{"key":"34_CR15","unstructured":"Niu, Y.S., Pham D.T.: Efficient DC programming approaches for mixed-integer quadratic convex programs. In: International Conference on Industrial Engineering and Systems Management (IESM 2011), pp. 222\u2013231 (2011)"},{"key":"34_CR16","doi-asserted-by":"crossref","unstructured":"Niu, Y.S.: On combination of DCA branch-and-bound and DC-Cut for solving mixed 0-1 linear program. In: 21st International Symposium on Mathematical Programming (ISMP 2012). Berlin (2012)","DOI":"10.1155\/2012\/364607"},{"key":"34_CR17","unstructured":"Niu, Y.S.: A parallel branch and bound with DC algorithm for mixed integer optimization. In: 23rd International Symposium in Mathematical Programming (ISMP 2018). Bordeaux, France (2018)"},{"key":"34_CR18","unstructured":"Pham, D.T., Le Thi, H.A.: Convex analysis approach to D.C. programming: theory, algorithm and applications. Acta Math. Vietnam. 22(1), 289\u2013355 (1997)"},{"key":"34_CR19","unstructured":"Pham, D.T., Le Thi, H.A.: A D.C. optimization algorithm for solving the trust-region subproblem. SIAM J. Optim. 8(2), 476\u2013505 (1998)"},{"issue":"2","key":"34_CR20","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/s11590-015-0931-2","volume":"10","author":"DT Pham","year":"2016","unstructured":"Pham, D.T., Le Thi, H.A., Pham, V.N., Niu, Y.S.: DC programming approaches for discrete portfolio optimization under concave transaction costs. Optim. Lett. 10(2), 261\u2013282 (2016)","journal-title":"Optim. Lett."},{"key":"34_CR21","doi-asserted-by":"publisher","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, The IBM Research Symposia Series, pp. 85\u2013103. Springer, Boston (1972). \n                    https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"4","key":"34_CR22","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/s10878-011-9396-0","volume":"24","author":"J Schleich","year":"2012","unstructured":"Schleich, J., Le Thi, H.A., Bouvry, P.: Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA. J. Comb. Optim. 24(4), 397\u2013412 (2012)","journal-title":"J. Comb. Optim."}],"container-title":["Advances in Intelligent Systems and Computing","Optimization of Complex Systems: Theory, Models, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-21803-4_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T05:44:05Z","timestamp":1572587045000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-21803-4_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,15]]},"ISBN":["9783030218027","9783030218034"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-21803-4_34","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2019,6,15]]},"assertion":[{"value":"15 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WCGO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"World Congress on Global Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Metz","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wcgo2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}