Barreto L, Bauer M. Parallel branch and bound algorithm-a comparison between serial, openMP and MPI implementations In Journal of Physics: Conference Series, vol. 256, 2010,IOP Publishing: Bristol, UK; 012–018.
Evtushenko Y, Posypkin M, Sigal I. A framework for parallel large-scale global optimization. Computer Science-Research and Development. 2009; 23(3): 211–215.
Paulavičius R, Žilinskas J. Parallel branch and bound algorithm with combination of Lipschitz bounds over multidimensional simplices for multicore computers. Parallel Scientific Computing and Optimization 2009; 27: 93–102.
Sanjuan-Estrada JF, Casado LG, García I. Adaptive parallel interval branch and bound algorithms based on their performance for multicore architectures. The Journal of Supercomputing 2011; 58(3): 1–9.
Gendron B, Crainic TG. Parallel branch and bound algorithms: survey and synthesis. Operations Research. 1994; 42: 1042–1066.
Leroy R, Mezmaz M, Melab N, Tuyttens D. Work stealing strategies for multi-core parallel branch-and-bound algorithm using factorial number system. In Proceedings of Programming Models and Applications on Multicores And Manycores, PMAM'14. ACM: New York, NY, USA, 2007; 111:111–111:119.
Goldengorin B, Ghosh D, Sierksma G. Branch and peg algorithms for the simple plant location problem. Computers & Operations Research. 2004; 31: 241–255.
Pastor R, Corominas A. Branch and win: OR tree search algorithms for solving combinatorial optimisation problems. Top. 2004; 1: 169–192.
Climer S, Zhang W. Cut-and-solve: an iterative search strategy for combinatorial optimization problems, Artificial Intelligence. 2006; 170(8–9): 714–738.
Melab N. Contributions à la résolution de problèmes d'optimisation combinatoire sur grilles de calcul, LIFL, USTL, 2005. Thèse HDR.
Cung VD, Dowaji S, Le Cun B, Mautor T, Roucairol C. Parallel and distributed branch-and-bound/A* algorithms. Technical Report 94/31, Laboratoire PRISM, Université de Versailles, 1994.
Melab N, Chakroun I, Bendjoudi A. Graphics processing unit-accelerated bounding for branch-and-bound applied to a permutation problem using data access optimization. Concurrency and Computation: Practice and Experience. 2014; 26(16): 2667–2683.
Blumofe RD, Leiserson CE. Scheduling multithreaded computations by work stealing. Journal of the ACM (JACM). 1999; 46(5): 720–748.
Frigo M, Leiserson CE, Randall KH. The implementation of the Cilk-5 multithreaded language. In Proceedings of the ACM Sigplan 1998 Conference on Programming Language Design and Implementation, PLDI '98. ACM: New York, NY, USA, 1998; 212–223.
Olivier SL, Porterfield AK, Wheeler KB, Spiegel M, Prins JF. OpenMP task scheduling strategies for multicore NUMA systems. International Journal of High Performance Computing Applications. 2012; 26(2): 1094342011434065.
Duran A, Corbalán J, Ayguadé E. Evaluation of openMP task scheduling strategies. In Openmp in a New Era of ParallelismSpringer: Berlin/Heidelberg, Germany 2008; 100–110.
Reinders J. Intel threading building blocks (First). O'Reilly & Associates, Inc.: Sebastopol, CA, USA, 2007.
Lea D. A java fork/join framework. In Proceedings of the ACM 2000 Conference on Java Grande, JAVA '00. ACM: New York, NY, USA, 2000; 36–43.
Weiland M. Chapel, fortress and x10: novel languages for HPC. In HPCxTR0706, EPCC, The University of Edinburgh, 2007.
Nelson J, Holt B, Myers B, Briggs P, Ceze L, Kahan S, Oskin M. Grappa: a latency-tolerant runtime for large-scale irregular applications. Technical report UW-CSE-14-02-01.
Kaiser H, Heller T, Adelstein-Lelbach B, Serio A, Fey D. Hpx: A task based programming model in a global address space. In Proceedings of the 8th International Conference on Partitioned Global Address Space Programming ModelsACM, Eugene, OR 2014; 6.
Wheeler KB, Murphy RC, Thain D. Qthreads: An API for programming with millions of lightweight threads. In IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2008. IEEE: New York, NY, 2008; 1–8.
Shavit N. Data structures in the multicore age. Communications ACM 2011; 54(3): 76–84.
Arora NS, Blumofe RD, Plaxton CG. Thread scheduling for multiprogrammed multiprocessors. Theory of Computing Systems. 2001; 34(2): 115–144.
Hendler D, Lev Y, Moir M, Shavit N. A dynamic-sized nonblocking work stealing deque, 2005.
Chase D, Lev Y. Dynamic circular work-stealing deque. In Proceedings of the Seventeenth Annual ACM Symposium on Parallelism in Algorithms and Architectures. ACM, Las Vegas, NV 2005; 21–28.
Dinan J, Larkins DB, Sadayappan P, Krishnamoorthy S, Nieplocha J. Scalable work stealing. In Proceedings of the Conference on High Performance Computing Networking, Storage And Analysis, Article no. 53, SC '09. ACM: New York, NY, USA, 2009.
Acar UA, Chargueraud A, Rainey M. Scheduling parallel programs by work stealing with private deques. In Proceedings of the 18th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP '13. ACM: New York, NY, USA, 2013; 219–228.
van Dijk T, van de Pol JC. Lace: non-blocking split deque for work-stealing. In Euro-par 2014: Parallel Processing Workshops. Springer, Porto, Portugal 2014; 206–217.
Le Cun B, Roucairol C. Concurrent data structures for tree search algorithms. In Parallel Algorithms for Irregular Problems: State of the Art,Springer US: New York, NY, 1995; 135–155.
Wimmer M, Cederman D, Träff JL, Tsigas P. Configurable strategies for work-stealing. arXiv preprint arXiv:1305.6474, 2013.
Perarnau S, Sato M. Victim selection and distributed work stealing performance: a case study. In 2014 IEEE 28th International Parallel and Distributed Processing Symposium, IEEE, Phoenix, AZ 2014; 659–668.
Kumar V, Rao VN, Ramesh K. Parallel depth first search on the ring architecture. Computer Science Department, University of Texas, Austin, TX, Technical Report AI88-68 1988.
Chu G, Schulte C, Stuckey PJ. Confidence-based work stealing in parallel constraint programming. In Principles and Practice of Constraint Programming-CP 2009,Springer: Berlin/Heidelberg, Germany 2009; 226–241.
Belikov E. 2014. History-based Adaptive Work Distribution. In 2014 Imperial College Computing Student Workshop, Neykova R, Ng N (eds)., OpenAccess Series in Informatics (OASIcs), vol. 43 Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik: Dagstuhl, Germany; 3–10. (Available from: http://drops.dagstuhl.de/opus/volltexte/2014/4767) [Accessed on 22 December 2015].
Ahn TH, Sandu A, Watson LT, Shaffer CA, Cao Y, Baumann WT. A framework to analyze the performance of load balancing schemes for ensembles of stochastic simulations. International Journal of Parallel Programming 2014; 43(4): 597–630.
Cantor G. Zeitschrift für mathematik und physik 14, 1869.
Laisant CA. Sur la numération factorielle, application aux permutations. Bulletin de la Société Mathématique de France. 1888; 16: 176–183.
Knuth DE. The art of computer programming, volume 2:seminumerical algorithms. Reading, Ma. 1997; 194–209. ISBN=9780201896848.
McCaffrey J. Using permutations in.NET for improved systems security, 2003.
Mezmaz M, Melab N, Talbi. EG. A grid-enabled branch and bound algorithm for solving challenging combinatorial optimization problems. In Proceedings of 21th IEEE International Parallel and Distributed Processing Symp. (IPDPS): Long Beach, California, March 2007.
Saraswat VA, Kambadur P, Kodali S, Grove D, Krishnamoorthy S. Lifeline-based global load balancing. In Proceedings of the 16th Symposium on Principles and Pratice of Parallel Programming, PPoPP '11. ACM: New York, NY, USA, 2011; 201–212.
Garey MR, Johnson DS, Sethi R. The complexity of flow-shop and job-shop scheduling. Mathematics of Operations Research. 1976; 1: 117–129.
Lageweg BJ, Lenstra J, Kan AHGR. A general bounding scheme for the permutation flow-shop problem. Operations Research. 1978; 26(1): 53–67.
Johnson SM. Optimal two and three-stage production schedules with setup times included. Naval Research Logistis Quarterly. 1954; 1: 61–68.
Taillard E. Benchmarks for basic scheduling problems. Journal of Operational Research 1993; 64: 278–285.
