L. Barreto and M. Bauer. Parallel branch and bound algorithm-a comparison between serial, openmp and mpi implementations. In Journal of Physics: Conference Series, volume 256, page 012018. IOP Publishing, 2010.
G. Cantor. Zeitschrift für mathematik und physik 14, 1869.
S. Climer and W. Zhang. Cut-and-solve: An iterative search strategy for combinatorial optimization problems, artificial intelligence. 170:714-738, 2006.
V.D. Cung, S. Dowaji, B. Le Cun, T. Mautor, and C. Roucairol. Parallel and distributed branch-and-bound/A* algorithms. Technical Report 94/31, Laboratoire PRISM, Université de Versailles, 1994.
J. Eckstein, C. A. Phillips, and W. E. Hart. PICO: An object-oriented framework for parallel branch-and-bound. Research Report 40-2000, RUTCOR, 2000.
M.R. Garey, D.S. Johnson, and R. Sethi. The complexity of flow-shop and job-shop scheduling. Mathematics of Operations Research, 1:117-129, 1976.
B. Gendron and T.G. Crainic. Parallel Branch and Bound Algorithms: Survey and Synthesis. Operations Research, 42:1042-1066, 1994.
B. Goldengorin, D. Ghosh, and G. Sierksma. Branch and peg algorithms for the simple plant location problem. Computers & Operations Research, 31:241-255, 2004.
V.K. Janakiram, D.P. Agrawal, and R. Mehrotra. A Randomized Parallel Branch-and-bound Algorithm. In in Proc. of Int. Conf. on Parallel Processing, pages 69-75, Aug. 1988.
S.M. Johnson. Optimal two and three-stage production schedules with setup times included. Naval Research Logistis Quarterly, 1:61-68, 1954.
D.E. Knuth. The Art of Computer Programming, Volume 2: Seminumerical Algorithms. Reading, Ma, page 192, 1997. ISBN=9780201896848.
V. Kumar and L. Kanal. Parallel Branch-and-Bound Formulations For And/Or Tree Search. IEEE Trans. Pattern. Anal. and Machine Intell., PAMI-6:768-778, 1984.
C-A. Laisant. Sur la numération factorielle, application aux permutations. Bulletin de la Société Mathématique de France, 16:176-183, 1888.
J.K. Lenstra, B.J. Lageweg, and A.H.G. Rinnooy Kan. A General bounding scheme for the permutation flow-shop problem. Operations Research, 26(1):53-67, 1978.
J. McCaffrey. Using permutations in .NET for improved systems security, 2003.
N. Melab. Contributions à la résolution de problèmes d'optimisation combinatoire sur grilles de calcul. LIFL, USTL, Novembre 2005. Thèse HDR.
M. Mezmaz, N. Melab, and E-G. Talbi. A grid-enabled branch and bound algorithm for solving challenging combinatorial optimization problems. In In Proc. of 21th IEEE Intl. Parallel and Distributed Processing Symp. (IPDPS). Long Beach, California, March 2007.
M. Mezmaz, N. Melab, and D. Tuyttens. A multithreaded branch-and-bound algorithm for solving the flow-shop problem on a multicore environment, chapter 3, pages 53-70. Large Scale Network-Centric Distributed Systems. John Wiley & Sons, July 2013. ISBN-10: 0470936886, ISBN-13: 978-0470936887.
D.L. Miller and J.F. Pekny. The Role of Performance Metrics for Parallel Mathematical Programming Algorithms. ORSA J. Computing, 5(1):26-28, 1993.
R. Pastor and A. Corominas. Branch and win: Or tree search algorithms for solving combinatorial optimisation problems. Top, 1:169-192, 2004.
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, pages 93-102, 2009.
J.F. Sanjuan-Estrada, L.G. Casado, and I. García. Adaptive parallel interval branch and bound algorithms based on their performance for multicore architectures. The Journal of Supercomputing, pages 1-9, 2011.
E. Taillard. Benchmarks for basic scheduling problems. Journal of Operational Research, 64:278-285, .
