{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:12:38Z","timestamp":1742911958434,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"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_35","type":"book-chapter","created":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T22:03:24Z","timestamp":1560549804000},"page":"341-351","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Sentence Compression via DC Programming Approach"],"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":"Xi-Wei","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"You","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Faouzi Mohamed","family":"Benammour","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hu","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,15]]},"reference":[{"key":"35_CR1","unstructured":"Clarke, J., Lapata, M.: Global inference for sentence compression: an integer linear programming approach. J. Artif. Intell. Res. 31, 399\u2013429 (2008)"},{"key":"35_CR2","unstructured":"Gurobi 8.1.0. \n                    http:\/\/www.gurobi.com"},{"key":"35_CR3","doi-asserted-by":"crossref","unstructured":"Jing, H.: Sentence reduction for automatic text summarization. In: Proceedings of the 6th Applied Natural Language Processing Conference, pp. 310\u2013315 (2000)","DOI":"10.3115\/974147.974190"},{"key":"35_CR4","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0004-3702(02)00222-9","volume":"139","author":"K Knight","year":"2002","unstructured":"Knight, K., Marcu, D.: Summarization beyond sentence extraction: a probalistic approach to sentence compression. Artif. Intell. 139, 91\u2013107 (2002)","journal-title":"Artif. Intell."},{"issue":"2","key":"35_CR5","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."},{"issue":"3","key":"35_CR6","first-page":"1","volume":"45","author":"HA Thi Le","year":"2001","unstructured":"Le Thi, H.A., Pham, D.T.: A continuous approach for large-scale constrained quadratic zero-one programming. Optimization 45(3), 1\u201328 (2001)","journal-title":"Optimization"},{"key":"35_CR7","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."},{"key":"35_CR8","first-page":"271","volume":"23","author":"HA Thi Le","year":"2009","unstructured":"Le Thi, H.A., Nguyen, Q.T., Nguyen, H.T., et al.: Solving the earliness tardiness scheduling problem by DC programming and DCA. Math. Balk. 23, 271\u2013288 (2009)","journal-title":"Math. Balk."},{"issue":"4","key":"35_CR9","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."},{"key":"35_CR10","unstructured":"Le Thi, H.A., Minh, L.H., Pham, D.T., Bouvry, P.: Solving the perceptron problem by deterministic optimization approach based on DC programming and DCA. In: Proceeding in INDIN 2009, Cardiff. IEEE (2009)"},{"issue":"3","key":"35_CR11","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."},{"key":"35_CR12","unstructured":"MacDonald, D.: Discriminative sentence compression with soft syntactic constraints. In: Proceedings of EACL, pp. 297\u2013304 (2006)"},{"key":"35_CR13","doi-asserted-by":"crossref","unstructured":"Niu, Y.S., Pham, D.T.: A DC programming approach for mixed-integer linear programs. In: Modelling, Computation and Optimization in Information Systems and Management Sciences, CCIS, vol. 14, pp. 244\u2013253 (2008)","DOI":"10.1007\/978-3-540-87477-5_27"},{"key":"35_CR14","unstructured":"Niu, Y.S.: Programmation DC & DCA en Optimisation Combinatoire et Optimisation Polynomiale via les Techniques de SDP. Ph.D. thesis, INSA, France (2010)"},{"key":"35_CR15","unstructured":"Niu, Y.S., Pham, D.T.: Efficient DC programming approaches for mixed-integer quadratic convex programs. In: Proceedings of the International Conference on Industrial Engineering and Systems Management (IESM2011), pp. 222\u2013231 (2011)"},{"key":"35_CR16","unstructured":"Niu, Y.S.: On difference-of-SOS and difference-of-convex-SOS decompositions for polynomials (2018). \n                    arXiv:1803.09900"},{"key":"35_CR17","unstructured":"Niu, Y.S.: A parallel branch and bound with DC algorithm for mixed integer optimization. In: The 23rd International Symposium in Mathematical Programming (ISMP2018), Bordeaux, France (2018)"},{"issue":"3","key":"35_CR18","doi-asserted-by":"crossref","first-page":"1001","DOI":"10.1016\/j.ejor.2005.06.079","volume":"183","author":"HT Nguyen","year":"2007","unstructured":"Nguyen, H.T., Pham, D.T.: A continuous DC programming approach to the strategic supply chain design problem from qualified partner set. Eur. J. Oper. Res. 183(3), 1001\u20131012 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"35_CR19","unstructured":"NLTK 3.2.5: The Natural Language Toolkit. \n                    http:\/\/www.nltk.org"},{"issue":"2","key":"35_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."},{"issue":"4","key":"35_CR21","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_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T05:43:24Z","timestamp":1572587004000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-21803-4_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,15]]},"ISBN":["9783030218027","9783030218034"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-21803-4_35","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"}}]}}