A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem
暂无分享,去创建一个
[1] E. L. Lawler,et al. Computing Maximal "Polymatroidal" Network Flows , 1982, Math. Oper. Res..
[2] Uwe T. Zimmermann,et al. A polynomial cycle canceling algorithm for submodular flows , 1999, Math. Program..
[3] S. Thomas McCormick,et al. Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications , 1997, SIAM J. Comput..
[4] Satoru Iwata,et al. A faster algorithm for minimum cost submodular flows , 1998, SODA '98.
[5] Refael Hassin. Algorithms for the minimum cost circulation problem based on maximizing the mean improvement , 1992, Oper. Res. Lett..
[6] András Frank,et al. Finding feasible vectors of Edmonds-Giles polyhedra , 1984, J. Comb. Theory, Ser. B.
[7] Kazuo Murota,et al. Discrete convex analysis , 1998, Math. Program..
[8] Éva Tardos,et al. A strongly polynomial minimum cost circulation algorithm , 1985, Comb..
[9] András Frank,et al. An application of simultaneous diophantine approximation in combinatorial optimization , 1987, Comb..
[10] S. Thomas McCormick,et al. Two Strongly Polynomial Cut Cancelling Algorithms for Minimum Cost Network Flow , 1993, Discret. Appl. Math..
[11] P. Schönsleben. Ganzzahlige Polymatroid-Intersektions-Algorithmen , 1980 .
[12] L. Lovász,et al. Geometric Algorithms and Combinatorial Optimization , 1981 .
[13] Satoru Iwata,et al. A capacity scaling algorithm for convex cost submodular flows , 1996, SODA '96.
[14] S. Fujishige,et al. A PRIMAL ALGORITHM FOR THE SUBMODULAR FLOW PROBLEM WITH MINIMUM-MEAN CYCLE SELECTION , 1988 .
[15] Kazuo Murota. Submodular Flow Problem with a Nonseparable Cost Function , 1999, Comb..
[16] S. Fujishige. ALGORITHMS FOR SOLVING THE INDEPENDENT-FLOW PROBLEMS , 1978 .
[17] A. Schrijver. Total Dual Integrality from Directed Graphs, Crossing Families, and Sub- and Supermodular Functions , 1984 .
[18] Satoru Fujishige,et al. Submodular functions and optimization , 1991 .
[19] S. Thomas McCormick,et al. Canceling most helpful total submodular cuts for submodular flow , 1993, Conference on Integer Programming and Combinatorial Optimization.
[20] Tomasz Radzik. Newton's method for fractional combinatorial optimization , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[21] Satoru Iwata,et al. Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow , 2000, Math. Oper. Res..
[22] J. Edmonds,et al. A Min-Max Relation for Submodular Functions on Graphs , 1977 .
[23] S. Thomas McCormick,et al. Computing Maximum Mean Cuts , 1994, Discret. Appl. Math..
[24] Satoru Fujishige,et al. A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm , 1986, Math. Program..
[25] Satoru Fujishige,et al. A Strongly Polynomial Algorithm for Minimum Cost Submodular Flow Problems , 1989, Math. Oper. Res..
[26] S. Fujishige,et al. New algorithms for the intersection problem of submodular systems , 1992 .
[27] Uwe T. Zimmermann. Negative circuits for flows and submodular flows , 1992, Discret. Appl. Math..
[28] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .
[29] András Frank,et al. A Primal-Dual Algorithm for Submodular Flows , 1985, Math. Oper. Res..