{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:50:06Z","timestamp":1759063806509,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2018,1,24]],"date-time":"2018-01-24T00:00:00Z","timestamp":1516752000000},"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":["Math. Program."],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1007\/s10107-018-1234-z","type":"journal-article","created":{"date-parts":[[2018,1,24]],"date-time":"2018-01-24T08:56:35Z","timestamp":1516784195000},"page":"119-154","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Scaling, proximity, and optimization of integrally convex functions"],"prefix":"10.1007","volume":"175","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0105-7167","authenticated-orcid":false,"given":"Satoko","family":"Moriguchi","sequence":"first","affiliation":[]},{"given":"Kazuo","family":"Murota","sequence":"additional","affiliation":[]},{"given":"Akihisa","family":"Tamura","sequence":"additional","affiliation":[]},{"given":"Fabio","family":"Tardella","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,1,24]]},"reference":[{"key":"1234_CR1","volume-title":"Network Flows\u2014Theory, Algorithms and Applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows\u2014Theory, Algorithms and Applications. Prentice-Hall, Englewood Cliffs (1993)"},{"key":"1234_CR2","first-page":"3","volume":"53","author":"P Favati","year":"1990","unstructured":"Favati, P., Tardella, F.: Convexity in nonlinear integer programming. Ric. Oper. 53, 3\u201344 (1990)","journal-title":"Ric. Oper."},{"key":"1234_CR3","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.disopt.2014.02.002","volume":"12","author":"S Fujishige","year":"2014","unstructured":"Fujishige, S.: Bisubmodular polyhedra, simplicial divisions, and discrete convexity. Discrete Optim. 12, 115\u2013120 (2014)","journal-title":"Discrete Optim."},{"key":"1234_CR4","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/PL00011371","volume":"88","author":"S Fujishige","year":"2000","unstructured":"Fujishige, S., Murota, K.: Notes on L-\/M-convex functions and the separation theorems. Math. Program. 88, 129\u2013146 (2000)","journal-title":"Math. Program."},{"key":"1234_CR5","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1007\/978-3-540-68279-0_15","volume-title":"50 Years of Integer Programming 1958\u20132008","author":"R Hemmecke","year":"2010","unstructured":"Hemmecke, R., K\u00f6ppe, M., Lee, J., Weismantel, R.: Chapter 15 Nonlinear integer programming. In: J\u00fcnger, M., et al. (eds.) 50 Years of Integer Programming 1958\u20132008, pp. 561\u2013618. Springer, Berlin (2010)"},{"key":"1234_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.disopt.2015.07.001","volume":"18","author":"H Hirai","year":"2015","unstructured":"Hirai, H.: L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem. Discrete Optim. 18, 1\u201337 (2015)","journal-title":"Discrete Optim."},{"key":"1234_CR7","doi-asserted-by":"crossref","unstructured":"Hirai, H.: L-convexity on graph structures. J. Oper. Res. Soc. Japan (to appear) (2018)","DOI":"10.15807\/jorsj.61.71"},{"key":"1234_CR8","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s10479-007-0172-6","volume":"153","author":"DS Hochbaum","year":"2007","unstructured":"Hochbaum, D.S.: Complexity and algorithms for nonlinear optimization problems. Ann. Oper. Res. 153, 257\u2013296 (2007)","journal-title":"Ann. Oper. Res."},{"key":"1234_CR9","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1145\/96559.96597","volume":"37","author":"DS Hochbaum","year":"1990","unstructured":"Hochbaum, D.S., Shanthikumar, J.G.: Convex separable optimization is not much harder than linear optimization. J. Assoc. Comput. Mach. 37, 843\u2013862 (1990)","journal-title":"J. Assoc. Comput. Mach."},{"key":"1234_CR10","volume-title":"Resource Allocation Problems: Algorithmic Approaches","author":"T Ibaraki","year":"1988","unstructured":"Ibaraki, T., Katoh, N.: Resource Allocation Problems: Algorithmic Approaches. MIT Press, Boston (1988)"},{"key":"1234_CR11","first-page":"57","volume":"6","author":"T Iimura","year":"2010","unstructured":"Iimura, T.: Discrete modeling of economic equilibrium problems. Pac. J. Optim. 6, 57\u201364 (2010)","journal-title":"Pac. J. Optim."},{"key":"1234_CR12","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1016\/j.jmateco.2005.03.001","volume":"41","author":"T Iimura","year":"2005","unstructured":"Iimura, T., Murota, K., Tamura, A.: Discrete fixed point theorem reconsidered. J. Math. Econ. 41, 1030\u20131036 (2005)","journal-title":"J. Math. Econ."},{"key":"1234_CR13","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.dam.2013.12.005","volume":"166","author":"T Iimura","year":"2014","unstructured":"Iimura, T., Watanabe, T.: Existence of a pure strategy equilibrium in finite symmetric games where payoff functions are integrally concave. Discrete Appl. Math. 166, 26\u201333 (2014)","journal-title":"Discrete Appl. Math."},{"key":"1234_CR14","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10107-004-0562-3","volume":"103","author":"S Iwata","year":"2005","unstructured":"Iwata, S., Moriguchi, S., Murota, K.: A capacity scaling algorithm for M-convex submodular flow. Math. Program. 103, 181\u2013202 (2005)","journal-title":"Math. Program."},{"key":"1234_CR15","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1137\/S1052623499352012","volume":"13","author":"S Iwata","year":"2002","unstructured":"Iwata, S., Shigeno, M.: Conjugate scaling algorithm for Fenchel-type duality in discrete convex optimization. SIAM J. Optim. 13, 204\u2013211 (2002)","journal-title":"SIAM J. Optim."},{"key":"1234_CR16","doi-asserted-by":"publisher","first-page":"2897","DOI":"10.1007\/978-1-4419-7997-1_44","volume-title":"Handbook of Combinatorial Optimization","author":"N Katoh","year":"2013","unstructured":"Katoh, N., Shioura, A., Ibaraki, T.: Resource allocation problems. In: Pardalos, P.M., Du, D.-Z., Graham, R.L. (eds.) Handbook of Combinatorial Optimization, vol. 5, 2nd edn, pp. 2897\u20132988. Springer, Berlin (2013)","edition":"2"},{"key":"1234_CR17","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1016\/j.ejor.2011.05.024","volume":"214","author":"G Laan van der","year":"2011","unstructured":"van der Laan, G., Talman, D., Yang, Z.: Solving discrete systems of nonlinear equations. Eur. J. Oper. Res. 214, 493\u2013500 (2011)","journal-title":"Eur. J. Oper. Res."},{"key":"1234_CR18","unstructured":"Moriguchi, S., Murota, K., Shioura, A.: Scaling algorithms for M-convex function minimization. In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol. E85\u2013A, pp. 922\u2013929 (2002)"},{"key":"1234_CR19","unstructured":"Moriguchi, S., Murota, K., Tamura, A., Tardella, F.: Discrete midpoint convexity. \n                    arXiv:1708.04579\n                    \n                   (2017)"},{"key":"1234_CR20","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 J. Optim. 21, 633\u2013668 (2011)","journal-title":"SIAM J. Optim."},{"key":"1234_CR21","first-page":"227","volume":"5","author":"S Moriguchi","year":"2009","unstructured":"Moriguchi, S., Tsuchimura, N.: Discrete L-convex function minimization based on continuous relaxation. Pac. J. Optim. 5, 227\u2013236 (2009)","journal-title":"Pac. J. Optim."},{"key":"1234_CR22","first-page":"313","volume":"83","author":"K Murota","year":"1998","unstructured":"Murota, K.: Discrete convex analysis. Math. Program. 83, 313\u2013371 (1998)","journal-title":"Math. Program."},{"key":"1234_CR23","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. SIAM, Philadelphia (2003)"},{"key":"1234_CR24","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-540-76796-1_11","volume-title":"Research Trends in Combinatorial Optimization","author":"K Murota","year":"2009","unstructured":"Murota, K.: Recent developments in discrete convex analysis. In: Cook, W., Lov\u00e1sz, L., Vygen, J. (eds.) Research Trends in Combinatorial Optimization, pp. 219\u2013260. Springer, Berlin (2009)"},{"key":"1234_CR25","first-page":"151","volume":"1","author":"K Murota","year":"2016","unstructured":"Murota, K.: Discrete convex analysis: a tool for economics and game theory. J. Mech. Inst. Des. 1, 151\u2013273 (2016)","journal-title":"J. Mech. Inst. Des."},{"key":"1234_CR26","unstructured":"Murota, K., Tamura, A.: Proximity Theorems of Discrete Convex Functions. RIMS Preprint 1358, Kyoto University (2002)"},{"key":"1234_CR27","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/s10107-003-0466-7","volume":"99","author":"K Murota","year":"2004","unstructured":"Murota, K., Tamura, A.: Proximity theorems of discrete convex functions. Math. Program. 99, 539\u2013562 (2004)","journal-title":"Math. Program."},{"key":"1234_CR28","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.laa.2005.08.004","volume":"413","author":"M Queyranne","year":"2006","unstructured":"Queyranne, M., Tardella, F.: Bimonotone linear inequalities and sublattices of \n                    \n                      \n                    \n                    $${\\mathbb{R}}^{n}$$\n                    \n                      \n                        \n                          \n                            R\n                          \n                          n\n                        \n                      \n                    \n                  . Linear Algebra Appl. 413, 100\u2013120 (2006)","journal-title":"Linear Algebra Appl."},{"key":"1234_CR29","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, New York (1986)"},{"key":"1234_CR30","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/S0166-218X(03)00255-5","volume":"134","author":"A Shioura","year":"2004","unstructured":"Shioura, A.: Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem. Discrete Appl. Math. 134, 303\u2013316 (2004)","journal-title":"Discrete Appl. Math."},{"key":"1234_CR31","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/BF01581240","volume":"59","author":"A Tamir","year":"1993","unstructured":"Tamir, A.: A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on series\u2013parallel networks. Math. Program. 59, 117\u2013132 (1993)","journal-title":"Math. Program."},{"key":"1234_CR32","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/j.orl.2009.05.003","volume":"37","author":"A Tamir","year":"2009","unstructured":"Tamir, A.: New pseudopolynomial complexity bounds for the bounded and other integer Knapsack related problems. Oper. Res. Lett. 37, 303\u2013306 (2009)","journal-title":"Oper. Res. Lett."},{"key":"1234_CR33","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s10107-004-0522-y","volume":"102","author":"A Tamura","year":"2005","unstructured":"Tamura, A.: Coordinatewise domain scaling algorithm for M-convex function minimization. Math. Program. 102, 339\u2013354 (2005)","journal-title":"Math. Program."},{"key":"1234_CR34","doi-asserted-by":"publisher","first-page":"976","DOI":"10.1287\/moor.1080.0343","volume":"33","author":"Z Yang","year":"2008","unstructured":"Yang, Z.: On the solutions of discrete nonlinear complementarity and related problems. Math. Oper. Res. 33, 976\u2013990 (2008)","journal-title":"Math. Oper. Res."},{"key":"1234_CR35","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s11784-009-0130-9","volume":"6","author":"Z Yang","year":"2009","unstructured":"Yang, Z.: Discrete fixed point analysis and its applications. J. Fixed Point Theory Appl. 6, 351\u2013371 (2009)","journal-title":"J. Fixed Point Theory Appl."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-018-1234-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-1234-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-1234-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T08:14:14Z","timestamp":1556093654000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-018-1234-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,24]]},"references-count":35,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2019,5]]}},"alternative-id":["1234"],"URL":"https:\/\/doi.org\/10.1007\/s10107-018-1234-z","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2018,1,24]]},"assertion":[{"value":"31 March 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 January 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 January 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}