| Document Date: 2010-06-19 14:25:51
Open Document File Size: 309,35 KBShare Result on Facebook
City Bethlehem / / Company Amdahl / / Currency pence / / / Facility Lehigh University / / IndustryTerm search strategies / search process / communications network / given parallel algorithm / parallel computing / node processing loop / given fractional solution / feasible solution / term search tree node / divide-and-conquer algorithm / depth-first search / suboptimal solutions / homogeneous processing nodes / branch-and-cut algorithm / sequential algorithm / search strategy / parallel computing platforms / dedicated high-speed communication network / commodity hardware / depth-first search attempt / search tree / message-passing protocol / fractional solution / few suboptimal solutions / parallel algorithm / branch-and-bound algorithm / search order / overall algorithm / software packages / message-passing protocols / branch-andcut algorithm / feasible solutions / increased processing power / / NaturalFeature ALPS / / Organization R. Any / Lehigh University / Department of Industrial and Systems Engineering / / / Position candidate for the partitioning operation / additional candidate / representative / candidate for partitioning / / ProvinceOrState Pennsylvania / / Technology one processor / Knowledge Management / overall algorithm / branch-andcut algorithm / message-passing protocols / simplest two-phase algorithm / parallel algorithm / branch-and-cut algorithm / message-passing protocol / branch-and-bound algorithm / given parallel algorithm / divide-and-conquer algorithm / / URL http /
SocialTag |
Parallel Branch and Cut T.K. Ralphs∗ Revised January 17, 2006 Abstract We discuss the main issues that arise in parallelizing the well-known branch-andcut algorithm for solving mixed-integer linear programs. Designing