Discrete convex analysis
暂无分享,去创建一个
[1] Kazuo Murota,et al. M-Convex Function on Generalized Polymatroid , 1999, Math. Oper. Res..
[2] W. Cunningham,et al. Matroid optimization and algorithms , 1996 .
[3] Kazuo Murota. Fenchel-type duality for matroid valuations , 1998, Math. Program..
[4] A. Recski. Matroid theory and its applications in electric network theory and in statics , 1989 .
[5] A. Barrett. Network Flows and Monotropic Optimization. , 1984 .
[6] Andreas W. M. Dress,et al. Well-layered maps and the maximum-degree k × k-subdeterminant of a matrix of rational functions , 1995 .
[7] Jürgen Kindler,et al. Sandwich theorems for set functions , 1988 .
[8] László Lovász,et al. Submodular functions and convexity , 1982, ISMP.
[9] Ulrich Faigle. Combinatorial Geometries: Matroids in Combinatorial Optimization , 1987 .
[10] R. Tyrrell Rockafellar. Conjugate Duality and Optimization , 1974 .
[11] Alexander Schrijver,et al. Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.
[12] Kazuo Murota,et al. Notes on L-/M-convex functions and the separation theorems , 2000, Math. Program..
[13] Dorit S. Hochbaum,et al. Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems , 1994, Math. Oper. Res..
[14] Satoru Fujishige,et al. On the subdifferential of a submodular function , 1984, Math. Program..
[15] Satoru Fujishige. Theory of submodular programs: A fenchel-type min-max theorem and subgradients of submodular functions , 1984, Math. Program..
[16] Joseph P. S. Kung. Theory of Matroids: Basis-Exchange Properties , 1986 .
[17] 丸山 徹. Convex Analysisの二,三の進展について , 1977 .
[18] Andreas W. M. Dress,et al. Well-layered maps—A class of greedily optimizable set functions , 1995 .
[19] László Lovász,et al. Matroid matching and some applications , 1980, J. Comb. Theory, Ser. B.
[20] Kazuo Murota,et al. On the Relationship between L-convex Functions and Submodular Integrally Convex Functions , 1997 .
[21] Donald M. Topkis,et al. Minimizing a Submodular Function on a Lattice , 1978, Oper. Res..
[22] András Frank,et al. A Weighted Matroid Intersection Algorithm , 1981, J. Algorithms.
[23] Kazuo Murota,et al. Short Proofs of the Separation Theorems for L-convex/concave and M-convex/concave Functions , 1997 .
[24] Claudio Barbieri da Cunha,et al. The logic of logistics: theory, algorithms and applications for logistics management , 1999 .
[25] Bruce E. Hajek,et al. Extremal Splittings of Point Processes , 1985, Math. Oper. Res..
[26] Kazuo Murota. Finding optimal minors of valuated bimatroids , 1995 .
[27] Kazuo Murota. Submodular Flow Problem with a Nonseparable Cost Function , 1999, Comb..
[28] S. Fujishige. ALGORITHMS FOR SOLVING THE INDEPENDENT-FLOW PROBLEMS , 1978 .
[29] A. Schrijver. Total Dual Integrality from Directed Graphs, Crossing Families, and Sub- and Supermodular Functions , 1984 .
[30] 藤重 悟. Submodular functions and optimization , 1991 .
[31] J. Stoer,et al. Convexity and Optimization in Finite Dimensions I , 1970 .
[32] Kazuo Murota,et al. Convexity and Steinitz's Exchange Property , 1996, IPCO.
[33] A. W. M. Dress,et al. Rewarding Maps: On Greedy Optimization of Set Functions , 1995 .
[34] 室田 一雄,et al. Matrices and matroids for systems analysis , 2000 .
[35] Eitan Altman,et al. Multimodularity, Convexity, and Optimization Properties , 2000, Math. Oper. Res..
[36] Akiyoshi Shioura,et al. Minimization of an M-convex Function , 1998, Discret. Appl. Math..
[37] Stein Krogdahl. The dependence graph for bases in matroids , 1977, Discret. Math..
[38] J. Edmonds. Matroid Intersection , 2022 .
[39] Walter Wenzel,et al. Valuated matroids: a new look at the greedy algorithm , 1989 .
[40] Kazuo Murota,et al. Valuated Matroid Intersection I: Optimality Criteria , 1996, SIAM J. Discret. Math..
[41] William H. Cunningham,et al. Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra , 1995, SIAM J. Discret. Math..
[42] András Frank,et al. Generalized polymatroids and submodular flows , 1988, Math. Program..
[43] A. Frank. An Algorithm for Submodular Functions on Graphs , 1982 .
[44] Dorit S. Hochbaum,et al. About strongly polynomial time algorithms for quadratic optimization over submodular constraints , 1995, Math. Program..
[45] Bernhard Korte,et al. Complexity of Matroid Property Algorithms , 1982, SIAM J. Comput..
[46] Kazuo Murota,et al. Valuated Matroid Intersection II: Algorithms , 1996, SIAM J. Discret. Math..
[47] M. Iri,et al. AN ALGORITHM FOR FINDING AN OPTIMAL "INDEPENDENT ASSIGNMENT" , 1976 .
[48] M. Minoux. Solving integer minimum cost flows with separable convex cost objective polynomially , 1986 .
[49] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..
[50] Kazuo Murota,et al. Extension of M-Convexity and L-Convexity to Polyhedral Convex Functions , 1999, Adv. Appl. Math..
[51] Gérard Cornuéjols,et al. Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the Rado-Edmonds theorem , 1984, Discret. Appl. Math..
[52] P. Favati. Convexity in nonlinear integer programming , 1990 .
[53] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.