Hitchcock F L. The distribution of a product from several sources to numerous locations [J]. Journal of Mathematical Physics, 1941, 20: 224-230. 李昆鹏, 马士华. ATO供应链中航空运输及并行机生产协调调度问题 [J]. 系统工程理论与实践, 2007, 27(12): 8-15. 白国仲, 朱小琨. JIT运输问题及其与其它运输问题的关系 [J]. 华中师范大学学报: 自然科学版, 2014, 48(3): 326-329. 靳鹏, 左春荣, 杨善林, 等. 下料问题与运输问题联合优化建模 [J]. 中国管理科学, 2013, 21(2): 91-97. 清华大学《运筹学》教材编写组. 运筹学 [M]. 北京: 清华大学出版社, 2005. 臧运华. 运输问题的一种图上解法 [J]. 运筹与管理, 2002, 11(4): 81-85. Hitchcock F L. The distribution of a product from several sources to numerous locations [J]. Journal of Mathematical Physics, 1941, 20: 224-230. 陈方年. 一类运输问题的启发式算法 [J]. 数学杂志, 2001, 21: 307-310. Haley K B. New methods in mathematical programming-The solid transportation problem [J]. Operations Research, 1962, 10: 448-463. Ojha A, Das B, Mondal S, et al. A solid transportation problem for an item with fixed charge, vehicle cost and price discounted varying charge using genetic algorithm [J]. Applied Soft Computing, 2010, 10: 100-110. Tao Z M, Xu J P. A class of rough multiple objective programming and its application to solid transportation problem [J]. Information Sciences, 2012, 188: 215-235. Boffi G, Rossi F. Gr\"obner bases related to 3-dimensional transportation problems [EB/OL]. [2014-06-27]. http://citeseerx.ist.psu.edu/viewdoc/versions?doi=10.1.1.22.4660. Boffi G, Rossi F. Lexicographic Gr\"obner bases of 3-dimensional transportation problems [J]. Contemporary Mathematics, 2001, 286: 145-168. Boffi G, Rossi F. Lexicographic Gr\"obner bases for transportation problems of format r\times3\times3 [J]. Journal of Symbolic Computation, 2006, 41: 336-356. Mosca R. A time expanded version of the (Hitchcock-)transportation problem [J]. European Transport Research Review, 2011, 3: 161-166. Hammer P L. Time minimizing transportation problems [J]. Naval Research Logistics Quarterly, 1969, 16: 345-357. Garfinkel R S, Rao M R. The bottleneck transportation problem [J]. Naval Research Logistics, 1971, 18: 465-472. Sharma J K, Swarup K. Time minimizing transportation problems [J]. Proceedings Mathematical Sciences, 1977, 86: 513-518. Jain M, Saksena P K. Time minimizing transportation problem with fractional bottleneck objective function [J]. Yugoslav Journal of Operations Research, 2012, 22: 115-129. Charnes A, Klingman D. The more-for-less paradox in the distribution model [J]. Cahiers de Centre d'Etudes Recharche Operationelle, 1971, 13: 11-22. 林耘. 谈运输问题“悖论”产生的条件 [J]. 运筹学杂志, 1984, 3(1): 79-80. 仇海全, 曹炳元, 潘花. 需求区间型运输间题的模糊优化模型 [J]. 重庆文理学院学报: 自然科学版, 2011, 30(6): 5-8. Chanas S, Kuehta D. A concept of the optimal solution of the transportation problem with fuzzy cost coefficients [J].Fuzzy Sets and Systems, 1996, 82: 299-305. 谢凡荣. 需求区间型运输问题的求解算法 [J]. 运筹与管理, 2005, 14(1): 23-27. Rudin W. Principles of Mathematical Analysis [M]. New York: McGraw-Hill, 1976. |