A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory
暂无分享,去创建一个
[1] H. D. Ratliff,et al. Minimum cuts and related problems , 1975, Networks.
[2] P. L. Ivanescu. Some Network Flow Problems Solved with Pseudo-Boolean Programming , 1965 .
[3] Jeffrey B. Sidney,et al. Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs , 1975, Oper. Res..
[4] Amnon Naamad,et al. Network flow and generalized path compression , 1979, STOC.
[5] J. Rhys. A Selection Problem of Shared Fixed Costs and Network Flows , 1970 .
[6] E. Lawler. Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints , 1978 .
[7] J. Picard. Maximal Closure of a Graph and Applications to Combinatorial Problems , 1976 .
[8] H. Donald Ratliff,et al. A Graph-Theoretic Equivalence for Integer Programs , 1973, Oper. Res..
[9] M. Balinski. Notes—On a Selection Problem , 1970 .
[10] C. Nash-Williams. Edge-disjoint spanning trees of finite graphs , 1961 .
[11] A. V. Karzanov,et al. Determining the maximal flow in a network by the method of preflows , 1974 .
[12] D. R. Fulkerson,et al. Flows in Networks. , 1964 .