學術產出-Periodical Articles

Article View/Open

Publication Export

Google ScholarTM

政大圖書館

Citation Infomation

  • No doi shows Citation Infomation
題名 Performance Analysis of a Parallel Dantzig-Wolfe Decomposition Algorithm for Linear Programming
作者 Luh,Hsing
陸行
Lee,Ming-Chang
Lyu,Jung Jr
貢獻者 應數系
關鍵詞 Linear programming; Decomposition algorithms; Parallel processing
日期 2002-11
上傳時間 24-Dec-2008 13:39:02 (UTC+8)
摘要 This paper employs the Dantzig-Wolfe decomposition principle to solve linear programming models in a parallel-computing environment. Adopting the queuing discipline, we showed that under very general conditions, the proposed algorithm speedup trends toward a limiting value as the number of processors increases.
關聯 Computers and Mathematics with Applications,44(10),1431-1437
資料類型 article
dc.contributor 應數系-
dc.creator (作者) Luh,Hsingen_US
dc.creator (作者) 陸行-
dc.creator (作者) Lee,Ming-Changen_US
dc.creator (作者) Lyu,Jung Jren_US
dc.date (日期) 2002-11en_US
dc.date.accessioned 24-Dec-2008 13:39:02 (UTC+8)-
dc.date.available 24-Dec-2008 13:39:02 (UTC+8)-
dc.date.issued (上傳時間) 24-Dec-2008 13:39:02 (UTC+8)-
dc.identifier.uri (URI) https://nccur.lib.nccu.edu.tw/handle/140.119/18842-
dc.description.abstract (摘要) This paper employs the Dantzig-Wolfe decomposition principle to solve linear programming models in a parallel-computing environment. Adopting the queuing discipline, we showed that under very general conditions, the proposed algorithm speedup trends toward a limiting value as the number of processors increases.-
dc.format application/en_US
dc.language enen_US
dc.language en-USen_US
dc.language.iso en_US-
dc.relation (關聯) Computers and Mathematics with Applications,44(10),1431-1437en_US
dc.subject (關鍵詞) Linear programming; Decomposition algorithms; Parallel processing-
dc.title (題名) Performance Analysis of a Parallel Dantzig-Wolfe Decomposition Algorithm for Linear Programmingen_US
dc.type (資料類型) articleen