A primal algorithm for solving a capacitated network flow problem with additional linear constraints
暂无分享,去创建一个
S. Chen | R. Saigal | R. Saigal | S. Chen | Stephen Chen
[1] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[2] C. M. Shetty,et al. Efficient computational devices for the capacitated transportation problem , 1974 .
[3] Darwin Klingman,et al. Solving Constrained Transportation Problems , 1972, Oper. Res..
[4] Robert E. Tarjan,et al. Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..
[5] R. Saigal,et al. An Extension of Generalized Upper Bounding Techniques for Structured Linear Programs , 1967 .
[6] Donald Ervin Knuth,et al. The Art of Computer Programming, Volume II: Seminumerical Algorithms , 1970 .
[7] Darwin Klingman,et al. The Augmented Predecessor Index Method for Locating Stepping-Stone Paths and Assigning Dual Prices in Distribution Problems , 1972 .
[8] D. R. Fulkerson,et al. Flows in Networks. , 1964 .
[9] Leon S. Lasdon,et al. Optimization Theory of Large Systems , 1970 .
[10] G. Dantzig,et al. GENERALIZED UPPER BOUNDED TECHNIQUES FOR LINEAR PROGRAMMING - I , 1964 .
[11] George B. Dantzig,et al. Generalized Upper Bounding Techniques , 1967, J. Comput. Syst. Sci..
[12] D. Klingman. Finding Equivalent Network Formulations for Constrained Network Problems , 1977 .
[13] Ellis L. Johnson,et al. Networks and Basic Solutions , 1966, Oper. Res..