| Document Date: 2010-06-19 14:25:53
Open Document File Size: 266,50 KBShare Result on Facebook
City Bethlehem / / Company IBM / Amdahl / / / Event Reorganization / / Facility Clemson University / Lehigh University / / IndustryTerm search process / Tree search / search progresses / search strategy / idle processing nodes / integer solution / bound algorithms / sequential algorithms / parallel computing concepts / software packages / related software / search tree node / bound algorithm / price algorithm / benchmark applications / price algorithms / cluster computing / given search tree node / neighborhood search / search trees / feasible solution / sequential algorithm / dedicated high-speed communication network / search tree / message-passing protocol / parallel algorithm / search tree nodes / message-passing protocols / feasible solutions / / Organization National Science Foundation / Cornell / S. Suppose / Lehigh University / Clemson University / Department of Industrial and Systems Engineering / / / Position salesman / / ProgrammingLanguage C++ / / ProvinceOrState New York / Pennsylvania / South Carolina / / Technology price algorithms / price algorithm / message-passing protocols / parallel algorithm / Bound Branch-and-bound algorithms / message-passing protocol / 2.1 Algorithm / shared memory / sequential algorithm / one processor / load balancing / artificial intelligence / related algorithm / / URL http /
SocialTag |
Parallel Branch, Cut, and Price for Large-Scale Discrete Optimization T. K. Ralphs∗ L. Lad´anyi†