W. Bo?-zejko, Solving the flow shop problem by parallel programming, Journal of Parallel and Distributed Computing, vol.69, issue.5, pp.470-481, 2009.
DOI : 10.1016/j.jpdc.2009.01.009

W. Bo?-zejko, Parallel path relinking method for the single machine total weighted tardiness problem with sequence-dependent setups, Journal of Intelligent Manufacturing, vol.37, issue.9???10, pp.777-785, 2010.
DOI : 10.1007/s10845-009-0253-2

W. Bo?-zejko, On single-walk parallelization of the job shop problem solving algorithms, Computers & Operations Research, vol.39, issue.9, pp.2258-2264, 2012.
DOI : 10.1016/j.cor.2011.11.009

W. Bo?-zejko and M. Wodecki, Parallel genetic algorithm for the flow shop scheduling problem, International Conference on Parallel Processing and Applied Mathematics, pp.566-571, 2003.

W. Bo?-zejko and M. Wodecki, Solving permutational routing problems by population-based metaheuristics, Computers & Industrial Engineering, vol.57, issue.1, pp.269-276, 2009.
DOI : 10.1016/j.cie.2008.11.022

W. J. Cook, In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation, 2012.
DOI : 10.1515/9781400839599

B. Feiring, An efficient procedure for obtaining feasible solutions to the n-city traveling salesman problem, Mathematical and Computer Modelling, vol.13, issue.3, pp.67-71, 1990.
DOI : 10.1016/0895-7177(90)90371-S
URL : https://doi.org/10.1016/0895-7177(90)90371-s

S. Jagiee-ll-lo and D. Zelazny, Solving multi-criteria vehicle routing problem by parallel tabu search on gpu, Procedia Computer Science, vol.18, pp.2529-2532, 2013.

M. Jünger, G. Rinaldi, and G. Reinelt, Chapter 4 The traveling salesman problem, Handbooks in Operations Research and Management Science, vol.7, pp.225-330, 1995.
DOI : 10.1016/S0927-0507(05)80121-5

A. H. Land and A. G. Doig, An automatic method of solving discrete programming problems, Econometrica: Journal of the Econometric Society, pp.497-520, 1960.
DOI : 10.2307/1910129
URL : http://jmvidal.cse.sc.edu/library/land60a.pdf

D. R. Morrison, S. H. Jacobson, J. J. Sauppe, and E. C. Sewell, Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning. Discrete Optimization 19, pp.79-102, 2016.

T. A. Toffolo, T. Wauters, S. V. Malderen, and G. V. Berghe, Branch-and-bound with decomposition-based lower bounds for the Traveling Umpire Problem, European Journal of Operational Research, vol.250, issue.3, pp.737-744, 2016.
DOI : 10.1016/j.ejor.2015.10.004