{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:28:38Z","timestamp":1750235318995,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319181608"},{"type":"electronic","value":"9783319181615"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18161-5_16","type":"book-chapter","created":{"date-parts":[[2015,4,30]],"date-time":"2015-04-30T08:51:26Z","timestamp":1430383886000},"page":"181-190","source":"Crossref","is-referenced-by-count":2,"title":["Continuous Relaxation for Discrete DC Programming"],"prefix":"10.1007","author":[{"given":"Takanori","family":"Maehara","sequence":"first","affiliation":[]},{"given":"Naoki","family":"Marumo","sequence":"additional","affiliation":[]},{"given":"Kazuo","family":"Murota","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","series-title":"Annals of Discrete Mathematics","volume-title":"Submodular Functions and Optimization","author":"S. Fujishige","year":"2005","unstructured":"Fujishige, S.: Submodular Functions and Optimization, 2nd edn. Annals of Discrete Mathematics, vol.\u00a058. Elsevier, Amsterdam (2005)","edition":"2"},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1021765131316","volume":"103","author":"R. Horst","year":"1999","unstructured":"Horst, R., Thoai, N.V.: DC Programming: Overview. Journal of Optimization Theory and Applications\u00a0103, 1\u201343 (1999)","journal-title":"Journal of Optimization Theory and Applications"},{"key":"16_CR3","unstructured":"Iyer, R., Jegelka, S., Bilmes, J.: Fast semidifferential-based submodular function optimization. In: Proceedings of the 30th International Conference on Machine Learning, pp.\u00a0855\u2013863 (2013)"},{"key":"16_CR4","unstructured":"Kawahara, Y., Washio, T.: Prismatic algorithm for discrete D.C. programming problem. In: Proceedings of the 25th Annual Conference on Neural Information Processing Systems, pp. 2106\u20132114 (2011)"},{"key":"16_CR5","unstructured":"Kobayashi, Y.: The complexity of maximizing the difference of two matroid rank functions. METR2014-42, University of Tokyo (2014)"},{"key":"16_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24488-9","volume-title":"Combinatorial Optimization","author":"B. Korte","year":"2012","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization, 5th edn. Springer, Berlin (2012)","edition":"5"},{"key":"16_CR7","unstructured":"Lemke, P.: The maximum leaf spanning tree problem for cubic graphs is NP-complete. IMA Preprint Series #428, University of Minnesota (1988)"},{"key":"16_CR8","unstructured":"Le-Thi, H.A.: DC Programming and DCA, \n                      http:\/\/www.lita.univ-lorraine.fr\/~lethi\/index.php\/en\/research\/dc-programming-and-dca.html\n                     (retrieved at February 23, 2015)"},{"key":"16_CR9","unstructured":"Maehara, T., Murota, K.: A framework of discrete DC programming by discrete convex analysis. Mathematical Programming (2014), \n                      http:\/\/link.springer.com\/article\/10.1007"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1137\/080736156","volume":"21","author":"S. Moriguchi","year":"2011","unstructured":"Moriguchi, S., Shioura, A., Tsuchimura, N.: M-convex function minimization by continuous relaxation approach\u2014Proximity theorem and algorithm. SIAM Journal on Optimization\u00a021, 633\u2013668 (2011)","journal-title":"SIAM Journal on Optimization"},{"key":"16_CR11","first-page":"227","volume":"5","author":"S. Moriguchi","year":"2009","unstructured":"Moriguchi, S., Tsuchimura, N.: Discrete L-convex function minimization based on continuous relaxation. Pacific Journal of Optimization\u00a05, 227\u2013236 (2009)","journal-title":"Pacific Journal of Optimization"},{"key":"16_CR12","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718508","volume-title":"Discrete Convex Analysis","author":"K. Murota","year":"2003","unstructured":"Murota, K.: Discrete Convex Analysis. Society for Industrial and Applied Mathematics, Philadelphia (2003)"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Murota, K.: Recent developments in discrete convex analysis. In: Cook, W., Lov\u00e1sz, L., Vygen, J. (eds.) Research Trends in Combinatorial Optimization, ch.\u00a011, pp. 219\u2013260. Springer, Berlin (2009)","DOI":"10.1007\/978-3-540-76796-1_11"},{"key":"16_CR14","unstructured":"Narasimhan, M., Bilmes, J.: A submodular-supermodular procedure with applications to discriminative structure learning. In: Proceedings of the 21st Conference on Uncertainty in Artificial Intelligence, pp. 404\u2013412 (2005)"},{"key":"16_CR15","volume-title":"Computer Networks","author":"A.S. Tanenbaum","year":"2010","unstructured":"Tanenbaum, A.S.: Computer Networks, 5th edn. Prentice Hall, Upper Saddle River (2010)","edition":"5"},{"key":"16_CR16","first-page":"289","volume":"22","author":"T. Pham Dinh","year":"1997","unstructured":"Pham Dinh, T., Le Thi, H.A.: Convex analysis approach to D.C. programming: Theory, algorithms and applications. Acta Mathematica Vietnamica\u00a022, 289\u2013355 (1997)","journal-title":"Acta Mathematica Vietnamica"},{"key":"16_CR17","first-page":"149","volume-title":"Handbook of Global Optimization","author":"T. Hoang","year":"1995","unstructured":"Hoang, T.: D.C. optimization: Theory, methods and algorithms. In: Horst, R., Pardalos, P.M. (eds.) Handbook of Global Optimization, pp. 149\u2013216. Kluwer Academic Publishers, Dordrecht (1995)"},{"key":"16_CR18","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1162\/08997660360581958","volume":"15","author":"A.L. Yuille","year":"2003","unstructured":"Yuille, A.L., Rangarajan, A.: The concave-convex procedure. Neural Computation\u00a015, 915\u2013936 (2003)","journal-title":"Neural Computation"}],"container-title":["Advances in Intelligent Systems and Computing","Modelling, Computation and Optimization in Information Systems and Management Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18161-5_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T05:18:57Z","timestamp":1676956737000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18161-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319181608","9783319181615"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18161-5_16","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2015]]}}}