POLYNOMIAL TIME INTERIOR POINT ALGORITHMS FOR TRANSPORTATION PROBLEMS

スポンサーリンク

概要

• 論文の詳細を見る

• This paper deals with the Hitchcock transportation problem with m supply points and n demand points. Assume that m <__- n and all the data are positive integers which are less than or equal to an integer M. We propose two polynomial time algorithms for solving the problems. The algorithms are based on the interior point algorithms for solving general linear programming problems. Using some features of the transportation problems, we decrease the computational complexities. We show that one of the algorithms requires at most O(m^3n^2 log nM + n^3) arithmetic operations and the other requires at most O(n^4 log nM) arithmetic operations.

• 社団法人日本オペレーションズ・リサーチ学会の論文

著者

• MIZUNO Shinji

  Department of Radiology, The University of Tokyo, Graduate School of Medicine

• Masuzawa K

  Toshiba Corp.

• Masuzawa Kaori

  Tokyo Institute of Technology

• Mizuno Shinji

  Department Of Industial Engineering And Management Tokyo Institute Of Technology

• Mizuno Shinji

  Department Of Industrial Engineering And Management Tokyo Institute Of Technology

関連論文

• Detection of cerebrospinal fluid leakage in intracranial hypotension with radionuclide cisternography and blood activity monitoring
• M Pathway and Areas 44 and 45 Are Involved in Stereoscopic Recognition Based on Binocular Disparity
• Glucose metabolism evaluated by positron emission tomography in Lafora disease
• A POLYNOMIAL TIME INTERIOR POINT ALGORITHM FOR MINIMUM COST FLOW PROBLEMS
• POLYNOMIAL TIME INTERIOR POINT ALGORITHMS FOR TRANSPORTATION PROBLEMS
• MR imaging and ^1H-MR spectroscopy in a case of juvenile Alexander disease
• PRACTICAL POLYNOMIAL TIME ALGORITHMS FOR LINEAR COMPLEMENTARITY PROBLEMS
• A convex property of monotone complementarity problems.
• AN O(n^3L) ALGORITHM USING A SEQUENCE FOR A LINEAR COMPLEMENTARITY PROBLEM

スポンサーリンク