A capacity scaling algorithm for M-convex submodular flow
暂无分享,去创建一个
[1] S. Fujishige,et al. New algorithms for the intersection problem of submodular systems , 1992 .
[2] Alexander Schrijver,et al. A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time , 2000, J. Comb. Theory B.
[3] Kazuo Murota,et al. Valuated Matroid Intersection II: Algorithms , 1996, SIAM J. Discret. Math..
[4] Satoru Iwata. A Faster Scaling Algorithm for Minimizing Submodular Functions , 2003, SIAM J. Comput..
[5] Richard M. Karp,et al. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.
[6] Dorit S. Hochbaum,et al. Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems , 1994, Math. Oper. Res..
[7] K. Murota. Convexity and Steinitz's Exchange Property , 1996 .
[8] Satoru Fujishige,et al. Submodular functions and optimization , 1991 .
[9] András Frank,et al. Finding feasible vectors of Edmonds-Giles polyhedra , 1984, J. Comb. Theory, Ser. B.
[10] Kazuo Murota,et al. Discrete convex analysis , 1998, Math. Program..
[11] András Frank,et al. A Primal-Dual Algorithm for Submodular Flows , 1985, Math. Oper. Res..
[12] Kazuo Murota,et al. Capacity scaling algorithm for scalable M-convex submodular flow problems , 2003, Optim. Methods Softw..
[13] Satoru Iwata,et al. A combinatorial strongly polynomial algorithm for minimizing submodular functions , 2001, JACM.
[14] Satoru Iwata,et al. A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem , 1999, IPCO.
[15] Dorit S. Hochbaum,et al. An efficient algorithm for image segmentation, Markov random fields and related problems , 2001, JACM.
[16] Kazuo Murota,et al. Valuated Matroid Intersection I: Optimality Criteria , 1996, SIAM J. Discret. Math..
[17] Akiyoshi Shioura,et al. Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem , 2004, Discret. Appl. Math..
[18] Kazuo Murota,et al. Application of M-Convex submodular flow problem to mathematical economics , 2001, ISAAC.
[19] Satoru Iwata,et al. Conjugate Scaling Algorithm for Fenchel-Type Duality in Discrete Convex Optimization , 2002, SIAM J. Optim..
[20] Akihisa Tamura. Coordinatewise domain scaling algorithm for M-convex function minimization , 2005, Math. Program..
[21] Dorit S. Hochbaum,et al. Solving the Convex Cost Integer Dual Network Flow Problem , 2003, Manag. Sci..
[22] Akihisa Tamura. A Coordinatewise Domain Scaling Algorithm for M-convex Function Minimization , 2002, IPCO.
[23] Kazuo Murota. Submodular Flow Problem with a Nonseparable Cost Function , 1999, Comb..
[24] S. Fujishige. ALGORITHMS FOR SOLVING THE INDEPENDENT-FLOW PROBLEMS , 1978 .
[25] Éva Tardos,et al. Layered Augmenting Path Algorithms , 1986, Math. Oper. Res..
[26] J. Edmonds,et al. A Min-Max Relation for Submodular Functions on Graphs , 1977 .
[27] Satoru Iwata,et al. A faster capacity scaling algorithm for minimum cost submodular flow , 2002, Math. Program..
[28] László Lovász,et al. Submodular functions and convexity , 1982, ISMP.
[29] Satoru Iwata,et al. A capacity scaling algorithm for convex cost submodular flows , 1996, SODA '96.
[30] Maurice Queyranne,et al. Minimizing a Convex Cost Closure Set , 2003, SIAM J. Discret. Math..