{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T14:23:19Z","timestamp":1763389399871,"version":"3.37.3"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2021,1,7]],"date-time":"2021-01-07T00:00:00Z","timestamp":1609977600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,7]],"date-time":"2021-01-07T00:00:00Z","timestamp":1609977600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11601327"],"award-info":[{"award-number":["11601327"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012170","name":"Project 985","doi-asserted-by":"crossref","award":["WF220426001"],"award-info":[{"award-number":["WF220426001"]}],"id":[{"id":"10.13039\/501100012170","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2021,10]]},"DOI":"10.1007\/s11590-020-01695-9","type":"journal-article","created":{"date-parts":[[2021,1,7]],"date-time":"2021-01-07T22:17:28Z","timestamp":1610057848000},"page":"2407-2432","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A difference-of-convex programming approach with parallel branch-and-bound for sentence compression via a hybrid extractive model"],"prefix":"10.1007","volume":"15","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":"Wenxu","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wentao","family":"Ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junpeng","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Songquan","family":"Yao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,7]]},"reference":[{"key":"1695_CR1","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming, 2nd edn. MIT Press, Cambridge (1999)","edition":"2"},{"key":"1695_CR2","volume-title":"Natural Language Processing with Python: Analyzing Text with the Natural Language Toolkit","author":"S Bird","year":"2009","unstructured":"Bird, S., Klein, E., Loper, E.: Natural Language Processing with Python: Analyzing Text with the Natural Language Toolkit. O\u2019Reilly Media Inc, Newton (2009)"},{"key":"1695_CR3","doi-asserted-by":"crossref","unstructured":"Chopra, S., Auli, M., Rush, A.M.: Abstractive sentence summarization with attentive recurrent neural networks. In: Proceedings of the 2016 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, pp. 93\u201398 (2016)","DOI":"10.18653\/v1\/N16-1012"},{"key":"1695_CR4","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1613\/jair.2433","volume":"31","author":"J Clarke","year":"2008","unstructured":"Clarke, J., Lapata, M.: Global inference for sentence compression: an integer linear programming approach. J. Artif. Intell. Res. 31, 399\u2013429 (2008)","journal-title":"J. Artif. Intell. Res."},{"key":"1695_CR5","doi-asserted-by":"crossref","unstructured":"Cohn, T., Lapata, M.: Sentence compression beyond word deletion. In: Proceedings of the 22nd International Conference on Computational Linguistics (Coling 2008), pp. 137\u2013144 (2008)","DOI":"10.3115\/1599081.1599099"},{"key":"1695_CR6","doi-asserted-by":"crossref","unstructured":"Filippova, K., Alfonseca, E., Colmenares, C.A., Kaiser, \u0141., Vinyals, O.: Sentence compression by deletion with LSTMS. In: Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing, pp. 360\u2013368 (2015)","DOI":"10.18653\/v1\/D15-1042"},{"key":"1695_CR7","unstructured":"Filippova, K., Altun, Y.: Overcoming the lack of parallel data in sentence compression. In: Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing, pp. 1481\u20131491 (2013)"},{"key":"1695_CR8","unstructured":"Gurobi optimizer reference manual. https:\/\/www.gurobi.com"},{"issue":"1","key":"1695_CR9","first-page":"15","volume":"87","author":"C Hori","year":"2004","unstructured":"Hori, C., Furui, S.: Speech summarization: an approach through word extraction and a method for evaluation. IEICE Trans. Inf. Syst. 87(1), 15\u201325 (2004)","journal-title":"IEICE Trans. Inf. Syst."},{"key":"1695_CR10","doi-asserted-by":"crossref","unstructured":"Jing, H.Y.: Sentence reduction for automatic text summarization. In: Sixth Applied Natural Language Processing Conference, pp. 310\u2013315 (2000)","DOI":"10.3115\/974147.974190"},{"issue":"1","key":"1695_CR11","doi-asserted-by":"publisher","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 probabilistic approach to sentence compression. Artif. Intell. 139(1), 91\u2013107 (2002)","journal-title":"Artif. Intell."},{"key":"1695_CR12","unstructured":"Le\u00a0Thi, H.A., Le, H.M., Pham, D.T., Bouvry, P.: Solving the perceptron problem by deterministic optimization approach based on DC programming and DCA. In: 2009 7th IEEE International Conference on Industrial Informatics, pp. 222\u2013226. IEEE (2009)"},{"issue":"4","key":"1695_CR13","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10287-009-0098-3","volume":"6","author":"HA Le Thi","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\u20134","key":"1695_CR14","first-page":"271","volume":"23","author":"HA Le Thi","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":"1\u20132","key":"1695_CR15","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1080\/02331930108844555","volume":"50","author":"HA Le Thi","year":"2001","unstructured":"Le Thi, H.A., Pham, D.T.: A continuous approach for globally solving linearly constrained quadratic zero-one programming problems. Optimization 50(1\u20132), 93\u2013120 (2001)","journal-title":"Optimization"},{"issue":"3","key":"1695_CR16","first-page":"23","volume":"133","author":"HA Le Thi","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(3), 23\u201346 (2005)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"1695_CR17","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10107-018-1235-y","volume":"169","author":"HA Le Thi","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."},{"issue":"3","key":"1695_CR18","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/s10898-011-9765-3","volume":"52","author":"HA Le Thi","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":"2","key":"1695_CR19","first-page":"169","volume":"22","author":"HA Le Thi","year":"1999","unstructured":"Le Thi, H.A., Pham, D.T., Muu, L.D.: Exact penalty in DC programming. Vietnam J. Math. 22(2), 169\u2013178 (1999)","journal-title":"Vietnam J. Math."},{"key":"1695_CR20","doi-asserted-by":"crossref","unstructured":"Manning, C.D., Surdeanu, M., Bauer, J., Finkel, J.R., Bethard, S., McClosky, D.: The stanford corenlp natural language processing toolkit. In: Proceedings of 52nd Annual Meeting of the Association for Computational Linguistics: System Demonstrations, pp. 55\u201360 (2014)","DOI":"10.3115\/v1\/P14-5010"},{"key":"1695_CR21","unstructured":"McDonald, R.: Discriminative sentence compression with soft syntactic evidence. In: 11th Conference of the European Chapter of the Association for Computational Linguistics (2006)"},{"key":"1695_CR22","doi-asserted-by":"crossref","unstructured":"Michele, B., Vibhu, O.M., Michael, J.W.: Headline generation based on statistical translation. In: Proceedings of the 38th Annual Meeting on Association for Computational Linguistics, pp. 318\u2013325. Association for Computational Linguistics (2000)","DOI":"10.3115\/1075218.1075259"},{"key":"1695_CR23","unstructured":"Niu, Y.S.: Programmation dc et dca en optimisation combinatoire et optimisation polynomiale via les techniques de sdp. Ph.D. thesis, INSA de Rouen, France (2010)"},{"key":"1695_CR24","unstructured":"Niu, Y.S.: PDCABB: a parallel mixed-integer nonlinear optimization solver (parallel DCA-BB global optimization algorithm). https:\/\/github.com\/niuyishuai\/PDCABB (2017)"},{"key":"1695_CR25","unstructured":"Niu, Y.S.: On difference-of-SOS and difference-of-convex-SOS decompositions for polynomials. arXiv preprint arXiv:1803.09900 (2018)"},{"key":"1695_CR26","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)"},{"key":"1695_CR27","doi-asserted-by":"crossref","unstructured":"Niu, Y.S., Pham, D.T.: A dc programming approach for mixed-integer linear programs. In: International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences, pp. 244\u2013253. Springer (2008)","DOI":"10.1007\/978-3-540-87477-5_27"},{"key":"1695_CR28","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), Metz, France, pp. 222\u2013231 (2011)"},{"key":"1695_CR29","doi-asserted-by":"crossref","unstructured":"Niu, Y.S., You, Y., Liu, W.Z.: Parallel DC cutting plane algorithms for mixed binary linear program. In: Proceedings of the World Congress on Global Optimization (WCGO2019), pp. 330\u2013340 (2019)","DOI":"10.1007\/978-3-030-21803-4_34"},{"key":"1695_CR30","unstructured":"NLTK 3.2.5: The natural language toolkit. http:\/\/www.nltk.org"},{"issue":"6","key":"1695_CR31","doi-asserted-by":"publisher","first-page":"1506","DOI":"10.1016\/j.ipm.2007.01.019","volume":"43","author":"P Over","year":"2007","unstructured":"Over, P., Dang, H., Harman, D.: DUC in context. Inf. Process. Manag. 43(6), 1506\u20131520 (2007)","journal-title":"Inf. Process. Manag."},{"issue":"1","key":"1695_CR32","first-page":"288","volume":"22","author":"DT Pham","year":"1997","unstructured":"Pham, D.T., Le Thi, H.A.: Convex analysis approach to D.C. programming: theory, algorithm and applications. Acta Math. Vietnam. 22(1), 288\u2013355 (1997)","journal-title":"Acta Math. Vietnam."},{"issue":"2","key":"1695_CR33","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1137\/S1052623494274313","volume":"8","author":"DT Pham","year":"1998","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)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1695_CR34","doi-asserted-by":"publisher","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":"1695_CR35","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"key":"1695_CR36","doi-asserted-by":"crossref","unstructured":"Rush, A.M., Chopra, S., Weston, J.: A neural attention model for abstractive sentence summarization. arXiv preprint arXiv:1509.00685 (2015)","DOI":"10.18653\/v1\/D15-1044"},{"issue":"4","key":"1695_CR37","doi-asserted-by":"publisher","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."},{"key":"1695_CR38","unstructured":"Stanford CoreNLP, natural language software. https:\/\/stanfordnlp.github.io\/CoreNLP\/"},{"key":"1695_CR39","unstructured":"Zajic, D., Dorr, B.J., Schwartz, R.: Bbn\/umd at duc-2004: Topiary. In: Proceedings of the HLT-NAACL 2004 Document Understanding Workshop, Boston pp. 112\u2013119 (2004)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01695-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-020-01695-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01695-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,22]],"date-time":"2024-08-22T01:55:40Z","timestamp":1724291740000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-020-01695-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,7]]},"references-count":39,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2021,10]]}},"alternative-id":["1695"],"URL":"https:\/\/doi.org\/10.1007\/s11590-020-01695-9","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2021,1,7]]},"assertion":[{"value":"1 February 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 December 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 January 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}