English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 93244/123616 (75%)
Visitors : 27796714      Online Users : 550
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    政大機構典藏 > 理學院 > 應用數學系 > 期刊論文 >  Item 140.119/18842
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/18842

    Title: Performance Analysis of a Parallel Dantzig-Wolfe Decomposition Algorithm for Linear Programming
    Authors: Luh,Hsing
    Lyu,Jung Jr
    Contributors: 應數系
    Keywords: Linear programming;Decomposition algorithms;Parallel processing
    Date: 2002-11
    Issue Date: 2008-12-24 13:39:02 (UTC+8)
    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.
    Relation: Computers and Mathematics with Applications,44(10),1431-1437
    Data Type: article
    Appears in Collections:[應用數學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    1431-1437.pdf461KbAdobe PDF683View/Open

    All items in 政大典藏 are protected by copyright, with all rights reserved.

    社群 sharing

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback