{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T00:05:11Z","timestamp":1759104311594,"version":"3.44.0"},"reference-count":28,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3521,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001700","name":"Ministry of Education, Culture, Sports, Science and Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001700","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2004,1]]},"DOI":"10.1016\/s0166-218x(03)00255-5","type":"journal-article","created":{"date-parts":[[2003,7,31]],"date-time":"2003-07-31T18:28:16Z","timestamp":1059676096000},"page":"303-316","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":30,"title":["Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem"],"prefix":"10.1016","volume":"134","author":[{"given":"Akiyoshi","family":"Shioura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1993","series-title":"Network Flows: Theory, Algorithms, and Applications","author":"Ahuja","key":"10.1016\/S0166-218X(03)00255-5_BIB1"},{"key":"10.1016\/S0166-218X(03)00255-5_BIB2","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0893-9659(90)90009-Z","article-title":"Valuated matroid","volume":"3","author":"Dress","year":"1990","journal-title":"Appl. Math. Lett."},{"key":"10.1016\/S0166-218X(03)00255-5_BIB3","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1016\/0001-8708(92)90028-J","article-title":"Valuated matroids","volume":"93","author":"Dress","year":"1992","journal-title":"Adv. Math."},{"key":"10.1016\/S0166-218X(03)00255-5_BIB4","first-page":"3","article-title":"Convexity in nonlinear integer programming","volume":"53","author":"Favati","year":"1990","journal-title":"Ricerca Operativa"},{"key":"10.1016\/S0166-218X(03)00255-5_BIB5","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1287\/opre.34.6.909","article-title":"The greedy procedure for resource allocation problems","volume":"34","author":"Federgruen","year":"1986","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(03)00255-5_BIB6","series-title":"Finite and Infinite Sets","first-page":"285","article-title":"Generalized Polymatroids","author":"Frank","year":"1984"},{"key":"10.1016\/S0166-218X(03)00255-5_BIB7","unstructured":"S. Fujishige, Submodular functions and optimization, Annals of Discrete Mathematics, Vol. 47, North-Holland, Amsterdam, 1999."},{"key":"10.1016\/S0166-218X(03)00255-5_BIB8","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1080\/02331939608844198","article-title":"A polynomial algorithm for resource allocation problems with polymatroid constraints","volume":"37","author":"Girlich","year":"1996","journal-title":"Optimization"},{"key":"10.1016\/S0166-218X(03)00255-5_BIB9","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0377-2217(91)90300-K","article-title":"Two algorithms for maximizing a separable concave function over a polymatroid feasible region","volume":"54","author":"Groenevelt","year":"1991","journal-title":"Eur. J. Oper. Res."},{"year":"1988","series-title":"Geometric Algorithms and Combinatorial Optimization","author":"Gr\u00f6tschel","key":"10.1016\/S0166-218X(03)00255-5_BIB10"},{"key":"10.1016\/S0166-218X(03)00255-5_BIB11","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1287\/moor.19.2.390","article-title":"Lower and upper bounds for the allocation problem and other nonlinear optimization problems","volume":"19","author":"Hochbaum","year":"1994","journal-title":"Math. Oper. Res."},{"year":"1988","series-title":"Resource Allocation Problems: Algorithmic Approaches","author":"Ibaraki","key":"10.1016\/S0166-218X(03)00255-5_BIB12"},{"key":"10.1016\/S0166-218X(03)00255-5_BIB13","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1145\/502090.502096","article-title":"A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions","volume":"48","author":"Iwata","year":"2001","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0166-218X(03)00255-5_BIB14","series-title":"Handbook of Combinatorial Optimization II","first-page":"159","article-title":"Resource allocation problems","author":"Katoh","year":"1998"},{"key":"10.1016\/S0166-218X(03)00255-5_BIB15","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1137\/0121018","article-title":"On minimizing nonseparable functions defined on the integers with an inventory application","volume":"21","author":"Miller","year":"1971","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0166-218X(03)00255-5_BIB16","unstructured":"S. Moriguchi, K. Murota, A. Shioura, Scaling algorithms for M-convex function minimization, IEICE Trans. Fundamentals E85-A (2002) 922\u2013929."},{"key":"10.1016\/S0166-218X(03)00255-5_BIB17","unstructured":"S. Moriguchi, A. Shioura, On Hochbaum's scaling algorithm for the general resource allocation problem, Research Report No. B-377, Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, 2002."},{"key":"10.1016\/S0166-218X(03)00255-5_BIB18","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1006\/aima.1996.0084","article-title":"Convexity and Steinitz's exchange property","volume":"124","author":"Murota","year":"1996","journal-title":"Adv. Math."},{"key":"10.1016\/S0166-218X(03)00255-5_BIB19","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/BF02680565","article-title":"Discrete convex analysis","volume":"83","author":"Murota","year":"1998","journal-title":"Math. Prog."},{"year":"2001","series-title":"Discrete Convex Analysis: An Introduction","author":"Murota","key":"10.1016\/S0166-218X(03)00255-5_BIB20"},{"key":"10.1016\/S0166-218X(03)00255-5_BIB21","unstructured":"K. Murota, On steepest descent algorithms for discrete convex functions, Technical Report METR 2002-12, Department of Mathematical Informatics, University of Tokyo, 2002."},{"year":"2003","series-title":"Discrete Convex Analysis","author":"Murota","key":"10.1016\/S0166-218X(03)00255-5_BIB22"},{"key":"10.1016\/S0166-218X(03)00255-5_BIB23","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1287\/moor.24.1.95","article-title":"M-convex function on generalized polymatroid","volume":"24","author":"Murota","year":"1999","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0166-218X(03)00255-5_BIB24","unstructured":"K. Murota, A. Shioura, Quasi M-convex and L-convex functions: quasi-convexity in discrete optimization, Discrete Appl. Math., to appear."},{"year":"1984","series-title":"Network Flows and Monotropic Optimization","author":"Rockafellar","key":"10.1016\/S0166-218X(03)00255-5_BIB25"},{"key":"10.1016\/S0166-218X(03)00255-5_BIB26","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1006\/jctb.2000.1989","article-title":"A combinatorial algorithm minimizing submodular functions in strongly polynomial time","volume":"B 80","author":"Schrijver","year":"2000","journal-title":"J. Combin. Theory Ser."},{"key":"10.1016\/S0166-218X(03)00255-5_BIB27","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/S0166-218X(97)00140-6","article-title":"Minimization of an M-convex function","volume":"84","author":"Shioura","year":"1998","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(03)00255-5_BIB28","doi-asserted-by":"crossref","unstructured":"A. Tamura, Coordinatewise domain scaling algorithm for M-convex function minimization, in: Proceedings of the Ninth Conference on Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, Vol. 2337, Springer, Berlin, 2002, pp. 21\u201335.","DOI":"10.1007\/3-540-47867-1_3"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X03002555?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X03002555?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T11:57:12Z","timestamp":1759060632000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X03002555"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1]]},"references-count":28,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["S0166218X03002555"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(03)00255-5","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[2004,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0166-218X(03)00255-5","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2003 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}