{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T06:52:43Z","timestamp":1750834363426},"publisher-location":"Berlin, Heidelberg","reference-count":95,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540767954"},{"type":"electronic","value":"9783540767961"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-76796-1_11","type":"book-chapter","created":{"date-parts":[[2008,11,6]],"date-time":"2008-11-06T07:24:04Z","timestamp":1225956244000},"page":"219-260","source":"Crossref","is-referenced-by-count":54,"title":["Recent Developments in Discrete Convex Analysis"],"prefix":"10.1007","author":[{"given":"Kazuo","family":"Murota","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1023\/B:JOCO.0000038913.96607.c2","volume":"8","author":"A. Ageev","year":"2004","unstructured":"Ageev, A., Sviridenko, M.: Pipage rounding: A new method of constructing algorithms with proven performance guarantee. J.\u00a0Comb. Optim. 8, 307\u2013328 (2004)","journal-title":"J.\u00a0Comb. Optim."},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1287\/moor.25.2.324.12230","volume":"25","author":"E. Altman","year":"2000","unstructured":"Altman, E., Gaujal, B., Hordijk, A.: Multimodularity, convexity, and optimization properties. Math. Oper. Res. 25, 324\u2013347 (2000)","journal-title":"Math. Oper. Res."},{"key":"11_CR3","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/b93837","volume-title":"Discrete-Event Control of Stochastic Networks: Multimodularity and Regularity","author":"E. Altman","year":"2003","unstructured":"Altman, E., Gaujal, B., Hordijk, A.: Discrete-Event Control of Stochastic Networks: Multimodularity and Regularity. Lecture Notes in Mathematics, vol.\u00a01829. Springer, Heidelberg (2003)"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0001-8708(92)90061-O","volume":"92","author":"H.-J. Bandelt","year":"1992","unstructured":"Bandelt, H.-J., Dress, A.W.M.: A canonical decomposition theory for metrics on a finite set. Adv. Math. 92, 47\u2013105 (1992)","journal-title":"Adv. Math."},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1137\/S0895480191222926","volume":"8","author":"A. Bouchet","year":"1995","unstructured":"Bouchet, A., Cunningham, W.H.: Delta-matroids, jump systems, and bisubmodular polyhedra. SIAM J. Discrete Math. 8, 17\u201332 (1995)","journal-title":"SIAM J. Discrete Math."},{"key":"11_CR6","first-page":"387","volume-title":"Mathematics in the Archaeological and Historical Sciences","author":"P. Buneman","year":"1971","unstructured":"Buneman, P.: The recovery of trees from measures of dissimilarity. In: Hodson, R.F., Kendall, D.G., Tautu, P. (eds.) Mathematics in the Archaeological and Historical Sciences, pp.\u00a0387\u2013395. Edinburgh University Press, Edinburgh (1971)"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-540-72792-7_15","volume-title":"Integer Programming and Combinatorial Optimization","author":"G. Calinescu","year":"2007","unstructured":"Calinescu, G., Chekuri, C., P\u00e1l, M., Vondr\u00e1k, J.: Maximizing a submodular set function subject to a matroid constraint (extended abstract). In: Fischetti, M., Williamson, D.P. (eds.) Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science, vol.\u00a04513, pp.\u00a0182\u2013196. Springer, Berlin (2007)"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/11809678_3","volume-title":"Computing and Combinatorics","author":"X. Chen","year":"2006","unstructured":"Chen, X., Deng, X.: A simplicial approach for discrete fixed point theorems. In: Chen, D.Z., Lee,\u00a0D.T. (eds.) Computing and Combinatorics. Lecture Notes in Computer Science, vol.\u00a04112, pp.\u00a03\u201312. Springer, Berlin (2006)"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0166-218X(84)90003-9","volume":"7","author":"M. Conforti","year":"1984","unstructured":"Conforti, M., Cornu\u00e9jols, G.: Submodular set functions, matroids and the greedy algorithm: tight worst-case bounds and some generalizations of the Rado\u2013Edmonds theorem. Discrete Appl. Math. 7, 251\u2013274 (1984)","journal-title":"Discrete Appl. Math."},{"key":"11_CR10","volume-title":"Combinatorial Optimization","author":"W.J. Cook","year":"1998","unstructured":"Cook, W.J., Cunningham, W.H., Pulleyblank, W.R., Schrijver, A.: Combinatorial Optimization. Wiley, New York (1998)"},{"key":"11_CR11","first-page":"58","volume":"241","author":"V.I. Danilov","year":"2003","unstructured":"Danilov, V.I., Koshevoy, G.A.: Discrete convexity and Hermitian matrices. Proc. Steklov Inst. Math. 241, 58\u201378 (2003)","journal-title":"Proc. Steklov Inst. Math."},{"key":"11_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-04295-9","volume-title":"Geometry of Cuts and Metrics","author":"M.M. Deza","year":"1997","unstructured":"Deza, M.M., Laurent, M.: Geometry of Cuts and Metrics. Springer, Berlin (1997)"},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0893-9659(90)90009-Z","volume":"3","author":"A.W.M. Dress","year":"1990","unstructured":"Dress, A.W.M., Wenzel, W.: Valuated matroid: A new look at the greedy algorithm. Appl. Math. Lett. 3, 33\u201335 (1990)","journal-title":"Appl. Math. Lett."},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/0001-8708(92)90028-J","volume":"93","author":"A.W.M. Dress","year":"1992","unstructured":"Dress, A.W.M., Wenzel, W.: Valuated matroids. Adv. Math. 93, 214\u2013250 (1992)","journal-title":"Adv. Math."},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1006\/eujc.1996.0015","volume":"17","author":"A.W.M. Dress","year":"1996","unstructured":"Dress, A.W.M., Moulton, V., Terhalle, W.: T-theory: an overview. Eur. J. Comb. 17, 161\u2013175 (1996)","journal-title":"Eur. J. Comb."},{"key":"11_CR16","first-page":"69","volume-title":"Combinatorial Structures and Their Applications","author":"J. Edmonds","year":"1970","unstructured":"Edmonds, J.: Submodular functions, matroids and certain polyhedra. In: Guy, R., Hanani, H., Sauer, N., Sch\u00f6nheim, J. (eds.) Combinatorial Structures and Their Applications, pp.\u00a069\u201387. Gordon and Breach, New York (1970). Also in: J\u00fcnger,\u00a0M., Reinelt,\u00a0G., Rinaldi, G. (eds.) Combinatorial Optimization\u2014Eureka, You Shrink! Lecture Notes in Computer Science, vol.\u00a02570, pp.\u00a011\u201326. Springer, Berlin (2003)"},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0012-365X(99)00260-5","volume":"217","author":"K. Eriksson","year":"2000","unstructured":"Eriksson, K., Karlander, J.: Stable matching in a common generalization of the marriage and assignment models. Discrete Math. 217, 135\u2013156 (2000)","journal-title":"Discrete Math."},{"key":"11_CR18","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":"11_CR19","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/BFb0121195","volume":"8","author":"M.L. Fisher","year":"1978","unstructured":"Fisher, M.L., Nemhauser, G.L., Wolsey, L.A.: An analysis of approximations for maximizing submodular set functions\u00a0II. Math. Program. Study 8, 73\u201387 (1978)","journal-title":"Math. Program. Study"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/3-540-45535-3_9","volume-title":"Integer Programming and Combinatorial Optimization","author":"T. Fleiner","year":"2001","unstructured":"Fleiner, T.: A matroid generalization of the stable matching polytope. In: Gerards, B., Aardal, K. (eds.) Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science, vol.\u00a02081, pp.\u00a0105\u2013114. Springer, Berlin (2001)"},{"key":"11_CR21","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1287\/moor.28.1.103.14256","volume":"28","author":"T. Fleiner","year":"2003","unstructured":"Fleiner, T.: A fixed point approach to stable matchings and some applications. Math. Oper. Res. 28, 103\u2013126 (2003)","journal-title":"Math. Oper. Res."},{"key":"11_CR22","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/0196-6774(81)90032-8","volume":"2","author":"A. Frank","year":"1981","unstructured":"Frank, A.: A weighted matroid intersection algorithm. J.\u00a0Algorithms 2, 328\u2013336 (1981)","journal-title":"J.\u00a0Algorithms"},{"key":"11_CR23","first-page":"97","volume":"16","author":"A. Frank","year":"1982","unstructured":"Frank, A.: An algorithm for submodular functions on graphs. Ann. Discrete Math. 16, 97\u2013120 (1982)","journal-title":"Ann. Discrete Math."},{"key":"11_CR24","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/BF02592218","volume":"29","author":"S. Fujishige","year":"1984","unstructured":"Fujishige, S.: Theory of submodular programs: A\u00a0Fenchel-type min-max theorem and subgradients of submodular functions. Math. Program. 29, 142\u2013155 (1984)","journal-title":"Math. Program."},{"key":"11_CR25","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\u00a0edn. Annals of Discrete Mathematics, vol.\u00a058. Elsevier, Amsterdam (2005)","edition":"2"},{"key":"11_CR26","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":"11_CR27","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1287\/moor.1070.0227","volume":"32","author":"S. Fujishige","year":"2007","unstructured":"Fujishige, S., Tamura, A.: A two-sided discrete-concave market with possibly bounded side payments: An\u00a0approach by discrete convex analysis. Math. Oper. Res. 32, 136\u2013155 (2007)","journal-title":"Math. Oper. Res."},{"key":"11_CR28","doi-asserted-by":"crossref","DOI":"10.1515\/9783110889741","volume-title":"Dirichlet Forms and Symmetric Markov Processes","author":"M. Fukushima","year":"1994","unstructured":"Fukushima, M., Oshima, Y., Takeda, M.: Dirichlet Forms and Symmetric Markov Processes. Walter de Gruyter, Berlin (1994)"},{"key":"11_CR29","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1090\/S0273-0979-00-00865-X","volume":"37","author":"W. Fulton","year":"2000","unstructured":"Fulton, W.: Eigenvalues, invariant factors, highest weights, and Schubert calculus. Bull., New Ser., Am. Math. Soc. 37, 209\u2013249 (2000)","journal-title":"Bull., New Ser., Am. Math. Soc."},{"key":"11_CR30","doi-asserted-by":"publisher","first-page":"9","DOI":"10.2307\/2312726","volume":"69","author":"D. Gale","year":"1962","unstructured":"Gale, D., Shapley, L.S.: College admissions and stability of marriage. Am. Math. Mon. 69, 9\u201315 (1962)","journal-title":"Am. Math. Mon."},{"key":"11_CR31","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1287\/moor.10.4.543","volume":"10","author":"B. Hajek","year":"1985","unstructured":"Hajek, B.: Extremal splittings of point processes. Math. Oper. Res. 10, 543\u2013556 (1985)","journal-title":"Math. Oper. Res."},{"key":"11_CR32","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s00454-006-1243-1","volume":"36","author":"H. Hirai","year":"2006","unstructured":"Hirai, H.: A geometric study of the split decomposition. Discrete Comput. Geom. 36, 331\u2013361 (2006)","journal-title":"Discrete Comput. Geom."},{"key":"11_CR33","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/BF03167590","volume":"21","author":"H. Hirai","year":"2004","unstructured":"Hirai, H., Murota, K.: M-convex functions and tree metrics. Jpn. J. Ind. Appl. Math. 21, 391\u2013403 (2004)","journal-title":"Jpn. J. Ind. Appl. Math."},{"key":"11_CR34","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1016\/S0304-4068(03)00007-7","volume":"39","author":"T. Iimura","year":"2003","unstructured":"Iimura, T.: A discrete fixed point theorem and its applications. J.\u00a0Math. Econ. 39, 725\u2013742 (2003)","journal-title":"J.\u00a0Math. Econ."},{"key":"11_CR35","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.\u00a0Math. Econ. 41, 1030\u20131036 (2005)","journal-title":"J.\u00a0Math. Econ."},{"key":"11_CR36","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s10107-006-0084-2","volume":"112","author":"S. Iwata","year":"2007","unstructured":"Iwata, S.: Submodular function minimization. Math. Program. Ser.\u00a0B 112, 45\u201364 (2007)","journal-title":"Math. Program. Ser.\u00a0B"},{"key":"11_CR37","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1137\/S1052623499352012","volume":"13","author":"S. Iwata","year":"2003","unstructured":"Iwata, S., Shigeno, M.: Conjugate scaling algorithm for Fenchel-type duality in discrete convex optimization. SIAM J. Optim. 13, 204\u2013211 (2003)","journal-title":"SIAM J. Optim."},{"key":"11_CR38","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\u00a0capacity scaling algorithm for M-convex submodular flow. Math. Program. 103, 181\u2013202 (2005)","journal-title":"Math. Program."},{"key":"11_CR39","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1137\/0211014","volume":"11","author":"P.M. Jensen","year":"1982","unstructured":"Jensen, P.M., Korte, B.: Complexity of matroid property algorithms. SIAM J. Comput. 11, 184\u2013190 (1982)","journal-title":"SIAM J. Comput."},{"key":"11_CR40","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.laa.2004.11.003","volume":"400","author":"A.V. Karzanov","year":"2005","unstructured":"Karzanov, A.V.: Concave cocirculations in a triangular grid. Linear Algebra Appl. 400, 67\u201389 (2005)","journal-title":"Linear Algebra Appl."},{"key":"11_CR41","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/s000290050037","volume":"4","author":"A.A. Klyachko","year":"1998","unstructured":"Klyachko, A.A.: Stable bundles, representation theory and Hermitian operators. Sel. Math. 4, 419\u2013445 (1998)","journal-title":"Sel. Math."},{"key":"11_CR42","first-page":"175","volume":"48","author":"A. Knutson","year":"2001","unstructured":"Knutson, A., Tao, T.: Honeycombs and sums of Hermitian matrices. Not. Am. Math. Soc. 48, 175\u2013186 (2001)","journal-title":"Not. Am. Math. Soc."},{"key":"11_CR43","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1090\/S0894-0347-03-00441-7","volume":"17","author":"A. Knutson","year":"2003","unstructured":"Knutson, A., Tao, T., Woodward, C.: The honeycomb model of GL n (C) tensor products\u00a0II: Puzzles determine facets of the Littlewood\u2013Richardson cone. J.\u00a0Am. Math. Soc. 17, 19\u201348 (2003)","journal-title":"J.\u00a0Am. Math. Soc."},{"key":"11_CR44","doi-asserted-by":"publisher","first-page":"1471","DOI":"10.1016\/j.dam.2007.03.010","volume":"155","author":"Y. Kobayashi","year":"2007","unstructured":"Kobayashi, Y., Murota, K.: Induction of M-convex functions by linking systems. Discrete Appl. Math. 155, 1471\u20131480 (2007)","journal-title":"Discrete Appl. Math."},{"key":"11_CR45","unstructured":"Kobayashi, Y., Takazawa, K.: Even factors, jump systems, and discrete convexity. METR 2007-36, Department of Mathematical Informatics, University of Tokyo (June 2007). J.\u00a0Comb. Theory, Ser.\u00a0B, to appear"},{"key":"11_CR46","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1137\/060652841","volume":"21","author":"Y. Kobayashi","year":"2007","unstructured":"Kobayashi, Y., Murota, K., Tanaka, K.: Operations on M-convex functions on jump systems. SIAM J. Discrete Math. 21, 107\u2013129 (2007)","journal-title":"SIAM J. Discrete Math."},{"key":"11_CR47","unstructured":"Koichi, S.: The Buneman index via polyhedral split decomposition. METR 2006-57, Department of Mathematical Informatics, University of Tokyo (November 2006)"},{"key":"11_CR48","unstructured":"Kolmogorov, V., Shioura, A.: New algorithms for the dual of the convex cost network flow problem with application to computer vision. Preprint (2007)"},{"key":"11_CR49","volume-title":"Combinatorial Optimization: Theory and Algorithms","author":"B. Korte","year":"2008","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms, 4th\u00a0edn. Springer, Berlin (2008)","edition":"4"},{"key":"11_CR50","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/j.geb.2005.02.006","volume":"55","author":"B. Lehmann","year":"2006","unstructured":"Lehmann, B., Lehmann, D., Nisan, N.: Combinatorial auctions with decreasing marginal utilities. Games Econ. Behav. 55, 270\u2013296 (2006)","journal-title":"Games Econ. Behav."},{"key":"11_CR51","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/0095-8956(80)90066-0","volume":"28","author":"L. Lov\u00e1sz","year":"1980","unstructured":"Lov\u00e1sz, L.: Matroid matching and some applications. J.\u00a0Comb. Theory, Ser.\u00a0B 28, 208\u2013236 (1980)","journal-title":"J.\u00a0Comb. Theory, Ser.\u00a0B"},{"key":"11_CR52","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/978-3-642-68874-4_10","volume-title":"Mathematical Programming\u2014The State of the Art","author":"L. Lov\u00e1sz","year":"1983","unstructured":"Lov\u00e1sz, L.: Submodular functions and convexity. In: Bachem, A., Gr\u00f6tschel, M., Korte, B. (eds.) Mathematical Programming\u2014The State of the Art, pp.\u00a0235\u2013257. Springer, Berlin (1983)"},{"key":"11_CR53","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1137\/0121018","volume":"21","author":"B.L. Miller","year":"1971","unstructured":"Miller, B.L.: On minimizing nonseparable functions defined on the integers with an inventory application. SIAM J. Appl. Math. 21, 166\u2013185 (1971)","journal-title":"SIAM J. Appl. Math."},{"key":"11_CR54","first-page":"922","volume":"85-A","author":"S. Moriguchi","year":"2002","unstructured":"Moriguchi, S., Murota, K., Shioura, A.: Scaling algorithms for M-convex function minimization. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 85-A, 922\u2013929 (2002)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"11_CR55","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1137\/S0895480195279994","volume":"9","author":"K. Murota","year":"1996","unstructured":"Murota, K.: Valuated matroid intersection, I: optimality criteria. SIAM J. Discrete Math. 9, 545\u2013561 (1996a)","journal-title":"SIAM J. Discrete Math."},{"key":"11_CR56","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1137\/S0895480195280009","volume":"9","author":"K. Murota","year":"1996","unstructured":"Murota, K.: Valuated matroid intersection,\u00a0II: algorithms. SIAM J. Discrete Math. 9, 562\u2013576 (1996b)","journal-title":"SIAM J. Discrete Math."},{"key":"11_CR57","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1006\/aima.1996.0084","volume":"124","author":"K. Murota","year":"1996","unstructured":"Murota, K.: Convexity and Steinitz\u2019s exchange property. Adv. Math. 124, 272\u2013311 (1996c)","journal-title":"Adv. Math."},{"key":"11_CR58","first-page":"357","volume":"82","author":"K. Murota","year":"1998","unstructured":"Murota, K.: Fenchel-type duality for matroid valuations. Math. Program. 82, 357\u2013375 (1998a)","journal-title":"Math. Program."},{"key":"11_CR59","first-page":"313","volume":"83","author":"K. Murota","year":"1998","unstructured":"Murota, K.: Discrete convex analysis. Math. Program. 83, 313\u2013371 (1998b)","journal-title":"Math. Program."},{"key":"11_CR60","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s004930050047","volume":"19","author":"K. Murota","year":"1999","unstructured":"Murota, K.: Submodular flow problem with a nonseparable cost function. Combinatorica 19, 87\u2013109 (1999)","journal-title":"Combinatorica"},{"key":"11_CR61","volume-title":"Matrices and Matroids for Systems Analysis","author":"K. Murota","year":"2000","unstructured":"Murota, K.: Matrices and Matroids for Systems Analysis. Springer, Berlin (2000)"},{"key":"11_CR62","volume-title":"Discrete Convex Analysis\u2014An Introduction","author":"K. Murota","year":"2001","unstructured":"Murota, K.: Discrete Convex Analysis\u2014An Introduction. Kyoritsu Publishing Co., Tokyo (2001) (in Japanese)"},{"key":"11_CR63","series-title":"SIAM Monographs on Discrete Mathematics and Applications","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 Monographs on Discrete Mathematics and Applications, vol.\u00a010. SIAM, Philadelphia (2003a)"},{"key":"11_CR64","doi-asserted-by":"publisher","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 (2003b)","journal-title":"SIAM J. Optim."},{"key":"11_CR65","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1287\/moor.1040.0142","volume":"30","author":"K. Murota","year":"2005","unstructured":"Murota, K.: Note on multimodularity and L-convexity. Math. Oper. Res. 30, 658\u2013661 (2005)","journal-title":"Math. Oper. Res."},{"key":"11_CR66","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1137\/040618710","volume":"20","author":"K. Murota","year":"2006","unstructured":"Murota, K.: M-convex functions on jump systems: A general framework for minsquare graph factor problem. SIAM J. Discrete Math. 20, 213\u2013226 (2006)","journal-title":"SIAM J. Discrete Math."},{"key":"11_CR67","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1287\/moor.24.1.95","volume":"24","author":"K. Murota","year":"1999","unstructured":"Murota, K., Shioura, A.: M-convex function on generalized polymatroid. Math. Oper. Res. 24, 95\u2013105 (1999)","journal-title":"Math. Oper. Res."},{"key":"11_CR68","doi-asserted-by":"publisher","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":"11_CR69","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/s10107-003-0478-3","volume":"101","author":"K. Murota","year":"2004","unstructured":"Murota, K., Shioura, A.: Conjugacy relationship between M-convex and L-convex functions in continuous variables. Math. Program. 101, 415\u2013433 (2004a)","journal-title":"Math. Program."},{"key":"11_CR70","first-page":"1042","volume":"87-A","author":"K. Murota","year":"2004","unstructured":"Murota, K., Shioura, A.: Fundamental properties of M-convex and L-convex functions in continuous variables. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 87-A, 1042\u20131052 (2004b)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"11_CR71","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1006\/aama.2000.0716","volume":"26","author":"K. Murota","year":"2001","unstructured":"Murota, K., Tamura, A.: On circuit valuation of matroids. Adv. Appl. Math. 26, 192\u2013225 (2001)","journal-title":"Adv. Appl. Math."},{"key":"11_CR72","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":"11_CR73","series-title":"Annals of Discrete Mathematics","volume-title":"Submodular Functions and Electrical Networks","author":"H. Narayanan","year":"1997","unstructured":"Narayanan, H.: Submodular Functions and Electrical Networks. Annals of Discrete Mathematics, vol.\u00a054. North-Holland, Amsterdam (1997)"},{"key":"11_CR74","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"G.L. Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions\u00a0I. Math. Program. 14, 265\u2013294 (1978)","journal-title":"Math. Program."},{"key":"11_CR75","volume-title":"Matroid Theory","author":"J.G. Oxley","year":"1992","unstructured":"Oxley, J.G.: Matroid Theory. Oxford University Press, Oxford (1992)"},{"key":"11_CR76","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-22143-3","volume-title":"Matroid Theory and Its Applications in Electric Network Theory and in Statics","author":"A. Recski","year":"1989","unstructured":"Recski, A.: Matroid Theory and Its Applications in Electric Network Theory and in Statics. Springer, Berlin (1989)"},{"key":"11_CR77","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R.T. Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"key":"11_CR78","doi-asserted-by":"crossref","DOI":"10.1017\/CCOL052139015X","volume-title":"Two-Sided Matching\u2014A\u00a0Study in Game-Theoretic Modeling and Analysis","author":"A.E. Roth","year":"1990","unstructured":"Roth, A.E., Sotomayor, M.A.O.: Two-Sided Matching\u2014A\u00a0Study in Game-Theoretic Modeling and Analysis. Cambridge University Press, Cambridge (1990)"},{"key":"11_CR79","volume-title":"Combinatorial Optimization\u2014Polyhedra and Efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization\u2014Polyhedra and Efficiency. Springer, Heidelberg (2003)"},{"key":"11_CR80","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198509424.001.0001","volume-title":"Phylogenetics","author":"C. Semple","year":"2003","unstructured":"Semple, C., Steel, M.: Phylogenetics. Oxford University Press, Oxford (2003)"},{"key":"11_CR81","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01753437","volume":"1","author":"L.S. Shapley","year":"1972","unstructured":"Shapley, L.S., Shubik, M.: The assignment game\u00a0I: The core. Int. J. Game Theory 1, 111\u2013130 (1972)","journal-title":"Int. J. Game Theory"},{"key":"11_CR82","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/S0166-218X(03)00255-5","volume":"134","author":"A. Shioura","year":"2003","unstructured":"Shioura, A.: Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem. Discrete Appl. Math. 134, 303\u2013316 (2003)","journal-title":"Discrete Appl. Math."},{"key":"11_CR83","unstructured":"Shioura, A.: On the pipage rounding algorithm for submodular function maximization: A view from discrete convex analysis. METR 2008-03, Department of Mathematical Informatics, University of Tokyo (January 2008)"},{"key":"11_CR84","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1137\/060656899","volume":"21","author":"A. Shioura","year":"2007","unstructured":"Shioura, A., Tanaka, K.: Polynomial-time algorithms for linear and convex optimization on jump systems. SIAM J. Discrete Math. 21, 504\u2013522 (2007)","journal-title":"SIAM J. Discrete Math."},{"key":"11_CR85","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s001820200116","volume":"31","author":"M. Sotomayor","year":"2002","unstructured":"Sotomayor, M.: A labor market with heterogeneous firms and workers. International J. Game Theory 31, 269\u2013283 (2002)","journal-title":"International J. Game Theory"},{"key":"11_CR86","unstructured":"Speyer, D.: Tropical linear spaces. arXiv:math.CO\/0410455 (2004)"},{"key":"11_CR87","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1515\/advg.2004.023","volume":"4","author":"D. Speyer","year":"2004","unstructured":"Speyer, D., Sturmfels, B.: The tropical Grassmannian. Adv. Geom. 4, 389\u2013411 (2004)","journal-title":"Adv. Geom."},{"key":"11_CR88","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0167-6377(03)00062-2","volume":"32","author":"M. Sviridenko","year":"2004","unstructured":"Sviridenko, M.: A note on maximizing a submodular set function subject to a knapsack constraint. Oper. Res. Lett. 32, 41\u201343 (2004)","journal-title":"Oper. Res. Lett."},{"key":"11_CR89","doi-asserted-by":"publisher","first-page":"1015","DOI":"10.2977\/prims\/1145475501","volume":"40","author":"A. Tamura","year":"2004","unstructured":"Tamura, A.: Applications of discrete convex analysis to mathematical economics. Publ. Res. Inst. Math. Sci. 40, 1015\u20131037 (2004)","journal-title":"Publ. Res. Inst. Math. Sci."},{"key":"11_CR90","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":"11_CR91","volume-title":"Supermodularity and Complementarity","author":"D.M. Topkis","year":"1998","unstructured":"Topkis, D.M.: Supermodularity and Complementarity. Princeton University Press, Princeton (1998)"},{"key":"11_CR92","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10107-005-0696-y","volume":"108","author":"G. der Laan van","year":"2006","unstructured":"van der Laan, G., Talman, D., Yang, Z.: Solving discrete zero point problems. Math. Program. 108, 127\u2013134 (2006)","journal-title":"Math. Program."},{"key":"11_CR93","doi-asserted-by":"crossref","unstructured":"Vondr\u00e1k, J.: Optimal approximation for the submodular welfare problem in the value oracle model. In: 40th ACM Symposium on Theory of Computing (May 2008)","DOI":"10.1145\/1374376.1374389"},{"volume-title":"Theory of Matroids","year":"1986","key":"11_CR94","unstructured":"White, N. (ed.): Theory of Matroids. Cambridge University Press, London (1986)"},{"key":"11_CR95","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1070.0482","author":"P. Zipkin","year":"2008","unstructured":"Zipkin, P.: On the structure of lost-sales inventory models. Oper. Res. (2008). doi: 10.1287\/opre.1070.0482","journal-title":"Oper. Res."}],"container-title":["Research Trends in Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-76796-1_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,2]],"date-time":"2024-03-02T08:56:49Z","timestamp":1709369809000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-76796-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540767954","9783540767961"],"references-count":95,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-76796-1_11","relation":{},"subject":[]}}