完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Chiou, Suh-Wen | |
dc.date.accessioned | 2009-08-23T04:41:34Z | |
dc.date.accessioned | 2020-05-25T06:39:27Z | - |
dc.date.available | 2009-08-23T04:41:34Z | |
dc.date.available | 2020-05-25T06:39:27Z | - |
dc.date.issued | 2006-10-16T03:55:14Z | |
dc.date.submitted | 2002-12-18 | |
dc.identifier.uri | http://dspace.lib.fcu.edu.tw/handle/2377/1496 | - |
dc.description.abstract | A multi-commodity flow problem is to find a deasible flow that satisfies the demand of each source to the sink in a directed network while the flow on each edge is within its capacity. In this paper we implement polynomial-time combinatorial approximation algorithms for ε - optimal multi-commodity flow problems. A new algorithm Optima is proposed and good test results are obtained. Application of Optima to a system-optimized multi-user network flow problem is given where substantially good test results have shown the capacity of Optima in dealing with problems of multi-commodity flow associated. | |
dc.description.sponsorship | 東華大學,花蓮縣 | |
dc.format.extent | 19p. | |
dc.format.extent | 191275 bytes | |
dc.format.mimetype | application/pdf | |
dc.language.iso | zh_TW | |
dc.relation.ispartofseries | 2002 ICS會議 | |
dc.subject | combiantorial optimization algorithms | |
dc.subject | minimum-cost flows | |
dc.subject | commodity flow | |
dc.title | Faster combinatorialapproximation algorithms for multicommodity flow problems and its applocation | |
分類: | 2002年 ICS 國際計算機會議 |
文件中的檔案:
檔案 | 描述 | 大小 | 格式 | |
---|---|---|---|---|
ce07ics002002000143.PDF | 186.79 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。