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 8 5 1997
D.A. Bader, W.E. Hart, and C.A. Phillips Parallel algorithm design for branch and bound Tutorial on Emerging Methodologies and Applications in Operations Research 2004 Kluwer Academic Press 1 44
T. Carneiro, A.E. Muritiba, M. Negreiros, G.A. Lima de Campos, A new parallel schema for branch-and-bound algorithms using GPGPU, in: 23rd International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD), 2011.
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 23 5 2008 689 701
I. Chakroun, and N. Melab An adaptive multi-GPU based branch-and-bound. a case study: the flowshop scheduling problem Proc. of 14th IEEE International Conference on High Performance Computing and Communications HPCC'12 2012 Liverpool UK
I. Chakroun, M. Mezmaz, N. Melab, and A. Bendjoudi Reducing thread divergence in a GPU-accelerated branch-and-bound algorithm Concurrency and Computation: Practice and Experience 25 8 2013 1121 1136
M. Esseghir Lalami, D. El-Baz, GPU Implementation of the Branch and Bound method for knapsack problems, in: IEEE 26th International Parallel and Distributed Processing Symposium Workshops, 2012.
M.R. Garey, and D.S. Johnson Computers and Intractability: A Guide to the Theory of NP-Completeness 1979 W.H. Freeman & Co. NY
S.M. Johnson Optimal two and three-stage production schedules with setup times included Naval Research Logistics Quarterly 1 1954 61 68
J.K. Lenstra, B.J. Lenstra, and A.H.G.R. Kan A general bounding scheme for the permutation flowshop problem Operations Research 26 1 1978 53 67 (Pubitemid 8576421)
N. Melab, I. Chakroun, M. Mezmaz, D. Tuyttens, A CPU-GPU accelerated branch-and-bound algorithm for the flowshop scheduling problem, in: 14th IEEE International Conference on Cluster Computing, Cluster'12, China, Beijing, September 24-28, 2012.
M. Mezmaz, N. Melab, and E.-G. Talbi A grid-enabled branch and bound algorithm for solving challenging combinatorial optimization problems Proc. of 21th IEEE Intl. Parallel and Distributed Processing Symp. (IPDPS) 2007 Long Beach California
http://www.nvidia.com/docs/IO/43395/NV-DS-Tesla-M2050-M2070-Apr10-LowRes. pdf
E. Taillard Taillard's FSP benchmarks http://www.mistic.heig-vd.ch/ taillard/problemes.dir/ordonnancement.dir/ordonnancement.html
S. Tschoke, R. Lubling, 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), 1995, pp. 182-189.
