{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T15:12:42Z","timestamp":1780585962996,"version":"3.54.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2013,2,5]],"date-time":"2013-02-05T00:00:00Z","timestamp":1360022400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1007\/s10107-013-0643-2","type":"journal-article","created":{"date-parts":[[2013,2,4]],"date-time":"2013-02-04T12:14:53Z","timestamp":1359980093000},"page":"163-177","source":"Crossref","is-referenced-by-count":21,"title":["Dijkstra\u2019s algorithm and L-concave function maximization"],"prefix":"10.1007","volume":"145","author":[{"given":"Kazuo","family":"Murota","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Akiyoshi","family":"Shioura","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,2,5]]},"reference":[{"key":"643_CR1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Upper Side River (1993)"},{"key":"643_CR2","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1016\/0167-6377(91)90027-M","volume":"10","author":"N-k Chung","year":"1991","unstructured":"Chung, N-k, Tcha, D-w: A dual algorithm for submodular flow problems. Oper. Res. Lett. 10, 489\u2013495 (1991)","journal-title":"Oper. Res. Lett."},{"key":"643_CR3","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1, 269\u2013271 (1959)","journal-title":"Numer. Math."},{"key":"643_CR4","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0167-5060(08)70734-9","volume":"1","author":"J Edmonds","year":"1977","unstructured":"Edmonds, J., Giles, R.: A min-max relation for submodular functions on graphs. Ann. Discrete Math. 1, 185\u2013204 (1977)","journal-title":"Ann. Discrete Math."},{"key":"643_CR5","volume-title":"Submodular Functions and Optimization","author":"F Fujishige","year":"2005","unstructured":"Fujishige, F.: Submodular Functions and Optimization, 2nd edn. Elsevier, Amsterdam (2005)","edition":"2"},{"key":"643_CR6","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1007\/BF02591772","volume":"25","author":"R Hassin","year":"1983","unstructured":"Hassin, R.: The minimum cost flow problem: a unifying approach to dual algorithms and a new tree-search algorithm. Math. Program. 25, 228\u2013239 (1983)","journal-title":"Math. Program."},{"key":"643_CR7","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1145\/502090.502096","volume":"48","author":"S Iwata","year":"2001","unstructured":"Iwata, S., Fleischer, L., Fujishige, S.: A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions. J. ACM 48, 761\u2013777 (2001)","journal-title":"J. ACM"},{"key":"643_CR8","doi-asserted-by":"crossref","unstructured":"Kalaba, R.: On some communication network problems. In: Bellman, R., Hall, M. Jr (eds.) Proceedings of Symposia in Applied Mathematics, vol. 10, pp. 261\u2013280. American Mathematical Society, Providence (1960)","DOI":"10.1090\/psapm\/010\/0122573"},{"key":"643_CR9","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1016\/j.disopt.2009.04.006","volume":"6","author":"V Kolmogorov","year":"2009","unstructured":"Kolmogorov, V., Shioura, A.: New algorithms for convex cost tension problem with application to computer vision. Discrete Optim. 6, 378\u2013393 (2009)","journal-title":"Discrete Optim."},{"key":"643_CR10","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":"643_CR11","first-page":"344","volume":"E83\u2013D","author":"K Murota","year":"2000","unstructured":"Murota, K.: Algorithms in discrete convex analysis. IEICE Trans. Syst. Inf. E83\u2013D, 344\u2013352 (2000)","journal-title":"IEICE Trans. Syst. Inf."},{"key":"643_CR12","doi-asserted-by":"crossref","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":"643_CR13","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1137\/S1052623402419005","volume":"14","author":"K Murota","year":"2003","unstructured":"Murota, K.: On steepest descent algorithms for discrete convex functions. SIAM J. Optim. 14, 699\u2013707 (2003)","journal-title":"SIAM J. Optim."},{"key":"643_CR14","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1006\/aama.2000.0702","volume":"25","author":"K Murota","year":"2000","unstructured":"Murota, K., Shioura, A.: Extension of M-convexity and L-convexity to polyhedral convex functions. Adv. Appl. Math. 25, 352\u2013427 (2000)","journal-title":"Adv. Appl. Math."},{"key":"643_CR15","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1006\/jctb.2000.1989","volume":"80","author":"A Schrijver","year":"2000","unstructured":"Schrijver, A.: A combinatorial algorithm minimizing submodular functions in strongly polynomial time. J. Comb. Theory Ser. B 80, 346\u2013355 (2000)","journal-title":"J. Comb. Theory Ser. B"},{"key":"643_CR16","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin (2003)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-013-0643-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-013-0643-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-013-0643-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,9]],"date-time":"2019-07-09T05:47:18Z","timestamp":1562651238000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-013-0643-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,5]]},"references-count":16,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["643"],"URL":"https:\/\/doi.org\/10.1007\/s10107-013-0643-2","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,5]]}}}