Affiliation:
1. Mathematics and Operational Research Department (MARO); University of Mons; Mons Belgium
2. INRIA Lille Nord Europe; Université Lille 1, CNRS/CRIStAL; Cité scientifique - 59655 Villeneuve d'Ascq cedex France
Subject
Computational Theory and Mathematics,Computer Networks and Communications,Computer Science Applications,Theoretical Computer Science,Software
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A computationally efficient Branch-and-Bound algorithm for the permutation flow-shop scheduling problem;European Journal of Operational Research;2020-08
2. YewPar;Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming;2020-02-19
3. The scalability analysis of a parallel tree search algorithm;Optimization Letters;2020-02-12
4. The Scalability Analysis of a Parallel Tree Search Algorithm;Communications in Computer and Information Science;2019
5. Optimal Solving of Permutation-based Optimization Problems on Heterogeneous CPU/GPU Clusters;2018 International Conference on High Performance Computing & Simulation (HPCS);2018-07