B. Gendron and T.G. Crainic. Parallel Branch-and-Bound Algorithms: Survey and Synthesis. Operations Research, 42(06):1042-1066, 1994.
B. Chapman, G. Jost, and R. Van Der Pas. Using OpenMP: portable shared memory parallel programming. Volume 10. The MIT Press, 2007.
B. J. Lageweg, J. K. Lenstra and A. H. G. Rinnooy Kan. A general bounding scheme for the permutation flow-shop problem. Operations Research, 26(1):53-67, 1978.
M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Commpleteness. W. H. Freeman & Co., New York, NY, 1979.
S.M. Johnson. Optimal two and three-stage production schedules with setup times included. Naval Research Logistis Quarterly, 1:61-68. 1954.
E. Taillard. Taillard's FSP benchmarks. http://mistic.heigvd. ch/taillard/problemes.dir/ordonnancement.dir/ordonnancement.html.
S. Tschoke, R. Lubling and B. Monien. Solving the traveling salesman problem with a distributed branch-and-bound algorithm on a 1024 processor network. In Proc. of 9th Intl. Parallel Processing Symposium (IPPS), pp. 182-189, 1995.
R. Allen, L. Cinque, S. Tanimoto, L. Shapiro and D. Yasuda. A parallel algorithm for graph matching and its MasPar implementation. IEEE Transactions on Parallel and Distributed Systems, Vol. 8, No. 5, 1997.
L.G. Casadoa, J.A. Martneza, I. Garcaa and E.M.T. Hendrixb. Branch-and-Bound interval global optimization on shared memory multiprocessors. Optimization Methods and Software, Vol. 23, No.5, pp. 689-701, 2008.
L. Barreto and M. Bauer. Parallel Branch and Bound Algorithm-A comparison between serial, OpenMP and MPI implementations. Journal of Physics: Conference Series, Vol. 256, No.5, pp. 012018, 2010.
M. Mezmaz, N. Melab and E-G. Talbi. A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems. In Proc. of 21th IEEE Intl. Parallel and Distributed Processing Symp. (IPDPS), Long Beach, California, March 26th-30th, 2007.
B. Nichols, D. Buttlar, and J.P. Farrell. Pthreads programming. O'Reilly Media, 1996.
M. Djamai, B. Derbel and N. Melab. Distributed B&B: A Pure Peer-to-Peer Approach. In Proc. of IEEE IPDPS'2011, Woks. on Large-Scale Parallel Processing (LSPP), May 16-20, Anchorage (Alaska), 2011.
T-V. Luong, N. Melab and E-G. Talbi. GPU Computing for Parallel Local Search Metaheuristic Algorithms. IEEE Transactions on Computers, http://doi.ieeecomputersociety.org/10.1109/TC.2011.206, 2012.
R.Paulavičius and J. Žilinskas. Parallel branch and bound algorithm with combination of Lipschitz bounds over multidimensional simplices for multicore computers. Parallel Scientific Computing and Optimization, Springer, pages 93-102,2009.
JF. Sanjuan-Estrada, LG. Casado and I. García. Adaptive parallel interval branch and bound algorithms based on their performance for multicore architectures, The Journal of Supercomputing, Springer, pages 1-9,2011.
NVIDIA CUDA C Programming Best Practices Guide. http://developer. download.nvidia.com/compute/cuda/2 3/toolkit/docs/NVIDIA CUDA BestPracticesGuide 2.3.pdf.
http://www.nvidia.com/docs/IO/43395/NV-DS-Tesla-C2050-C2070-jul10-lores. pdf
http://en.wikipedia.org/wiki/Comparison-of-Nvidia-graphics-processing- units
