Implementing Scalable Parallel Search Algorithms for Data-Intensive Applications
暂无分享,去创建一个
[1] Vijay P. Kumar,et al. Analyzing Scalability of Parallel Algorithms and Architectures , 1994, J. Parallel Distributed Comput..
[2] Vipin Kumar,et al. Parallel Search Algorithms for Discrete Optimization Problems , 1995, INFORMS J. Comput..
[3] Gerhard Reinelt,et al. A Cutting Plane Algorithm for the Linear Ordering Problem , 1984, Oper. Res..
[4] Leslie E. Trotter,et al. Branch, Cut, and Price: Sequential and Parallel , 2000, Computational Combinatorial Optimization.
[5] Michael Jünger,et al. Computational Combinatorial Optimization , 2001, Lecture Notes in Computer Science.
[6] George L. Nemhauser,et al. Experiments with parallel branch-and-bound algorithms for the set covering problem , 1993, Oper. Res. Lett..
[7] M. Padberg,et al. Lp-based combinatorial problem solving , 1985 .
[8] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[9] Giovanni Rinaldi,et al. A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems , 1991, SIAM Rev..
[10] Jonathan Eckstein,et al. Parallel Branch-and-Bound Algorithms for General Mixed Integer Programming on the CM-5 , 1994, SIAM J. Optim..
[11] Jonathan Eckstein,et al. How Much Communication Does Parallel Branch and Bound Need? , 1997, INFORMS J. Comput..
[12] Bernard Gendron,et al. Parallel Branch-and-Branch Algorithms: Survey and Synthesis , 1994, Oper. Res..
[13] Martin W. P. Savelsbergh,et al. A Branch-and-Price Algorithm for the Generalized Assignment Problem , 1997, Oper. Res..
[14] Teodor Gabriel Crainic,et al. PARALLEL BRANCH-AND-BOUND ALGORITHMS: SURVEY AND SYNTHESIS , 1993 .