@article{oai:ous.repo.nii.ac.jp:00000651,
 author = {成久, 洋之 and Narihisa, Hiroyuki},
 journal = {岡山理科大学紀要. A, 自然科学, The Bulletin of the Okayama University of Science, A, Natural  Science},
 month = {Mar},
 note = {P(論文), In classical transportation problems, North-West Cornor Method is most famous algorithm. We can express this transportation problems as compact tableau in stead of simplex tableau. In conpact tableau, each cell of the compact tableau can be considered as the node of graph. That is to say, a basic solution corresponds to some non-zero valued nodes. Therefore, we can obtain the optical solution only using some loop of the given graph. This is the reason why North-West Cornor Method may be called as loop technique. Of cource, this method may be called as stepping stone method. As an extension of this idea, the generalized tranportation problems is also able to use the loop technique. However, this extension is not necessary a straight forward modification of the famous stepping stone method for classical transportation problems. In this paper, I represent some topological aspects of basic feasible solution for the generalized transportation problems. Consequently, we can consider the algorithm solving the generalized transportation problems by using the properties of given topology corresponding to the basic solntions.},
 pages = {31--44},
 title = {Topological Aspects for Solving Generalized Transportation Problems},
 volume = {18},
 year = {1983},
 yomi = {ナリヒサ, ヒロユキ}
}