A method for the solution of transportation problems with tall matrices
暂无分享,去创建一个
[1] James E. Kelley,et al. Critical-Path Planning and Scheduling: Mathematical Basis , 1961 .
[2] S. Lambourn,et al. Resource allocation and multi-project scheduling (RAMPS) - a new tool in planning and control , 1963, Computer/law journal.
[3] Paul S. Dwyer. Use of completely reduced matrices in solving transportation problems with fixed charges , 1966 .
[4] Abraham Charnes,et al. The Stepping Stone Method of Explaining Linear Programming Calculations in Transportation Problems , 1954 .
[5] Heiner Mueller-Merbach,et al. An Improved Starting Algorithm for the Ford-Fulkerson Approach to the Transportation Problem , 1966 .
[6] P. S. Dwyer. The Direct Solution of the Transportation Problem with Reduced Matrices , 1966 .
[7] P. Hall. On Representatives of Subsets , 1935 .
[8] D. F. Votaw. Methods of solving some personnel-classification problems , 1952 .
[9] George B. Dantzig,et al. Linear programming and extensions , 1965 .
[10] Jack Moshman,et al. RAMPS: a technique for resource allocation and multi-project scheduling , 1899, AFIPS Spring Joint Computing Conference.
[11] H. E. Vaughan,et al. The Marriage Problem , 1950 .
[12] James P. Fourre. Critical path scheduling : a practical appraisal of PERT , 1968 .
[13] D. R. Fulkerson,et al. Flows in Networks. , 1964 .
[14] Jack B. Dennis,et al. A High-Speed Computer Technique for the Transportation Problem , 1958, JACM.
[15] Paul S. Dwyer,et al. The Method of Reduced Matrices for a General Transportation Problem , 1957, JACM.
[16] D. Malcolm,et al. Application of a Technique for Research and Development Program Evaluation , 1959 .
[17] T. E. Easterfield. A Combinatorial Algorithm , 1946 .