On the solution of travelling salesman problem, Documenta Mathemitica, pp.645-656, 1998. ,
Parallel and distributed branch-and-bound/A* algorithms, Laboratoire PRISM, 1994. ,
Banchmarks for basic scheduling problems, European Journal of European Research, vol.23, pp.661-673, 1993. ,
Parallel Branch-and-Branch Algorithms: Survey and Synthesis, Operations Research, vol.42, issue.6, pp.1042-1066, 1994. ,
DOI : 10.1287/opre.42.6.1042
A problem-specific fault-tolerance mechanism for asynchronous, distributed systems, Proceedings 2000 International Conference on Parallel Processing, pp.4-14, 2000. ,
DOI : 10.1109/ICPP.2000.876065
Solving large quadratic assignment problems on computational grids, Mathematical Programming, pp.341-357, 2001. ,
ContributionsàContributions`Contributionsà la rsolution deprobì emes d'optimisation combinatoire sur grilles de calcul, 2005. ,
The Complexity of Flowshop and Jobshop Scheduling, Mathematics of Operations Research, vol.1, issue.2, pp.117-129, 1976. ,
DOI : 10.1287/moor.1.2.117
A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem, European Journal of Operational Research, vol.177, issue.3, 2004. ,
DOI : 10.1016/j.ejor.2005.12.009