A POLYNOMIAL TIME INTERIOR POINT ALGORITHM FOR MINIMUM COST FLOW PROBLEMS

スポンサーリンク

概要

• 論文の詳細を見る

• This paper deals with a minimum cost flow problem. We propose a polynomial time algorithm for the problem. The algorithm is based on an interior point algorithm for a general linear programming problem. Using some features of the minimum cost flow problem, we decrease the running time. We show that the algorithm requires at most O(|El|^<0.5>log(|V|M)) iterations, O(|V|^3) arithmetic operations in each iteration, and O(|V|^3|E|^<0.5>log(|V|M)) arithmetic operations in total. Here |V|, |E| and M denote the number of nodes, that of arcs, and the maximum absolute value of input data, respectively.

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

著者

• MIZUNO Shinji

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

• Mizuno Shinji

  Department Of Radiology Gifu University School Of Medicine

• Mori Masao

  Tokyo Institute Of Technology

• Masuzawa Kaori

  Toshiba Corporation

• Mizuno Shinji

  Department Of Industial 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
• INVENTORY CONTROL POLICY FOR REPAIR PARTS
• POLYNOMIAL TIME INTERIOR POINT ALGORITHMS FOR TRANSPORTATION PROBLEMS
• MARKOV DECISION PROCESSES WITH RANDOM HORIZON
• 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

もっと見る 閉じる

スポンサーリンク