Heuristics for the 0-1 multidimensional knapsack problem. - Vincent Boyer 002; Moussa Elkihel; Didier El Baz (Eur. J. Oper. Res., 2009)

Multi GPU Implementation of the Simplex Algorithm. - Mohamed Esseghir Lalami; Didier El Baz; Vincent Boyer 002 (HPCC, 2011)

Efficient Implementation of the Simplex Method on a CPU-GPU System. - Mohamed Esseghir Lalami; Vincent Boyer 002; Didier El Baz (IPDPS Workshops, 2011)

Dense Dynamic Programming on Multi GPU. - Vincent Boyer 002; Didier El Baz; Moussa Elkihel (PDP, 2011)

A dynamic programming method with lists for the knapsack sharing problem. - Vincent Boyer 002; Didier El Baz; Moussa Elkihel (Comput. Ind. Eng., 2011)

Solving knapsack problems on GPU. - Vincent Boyer 002; Didier El Baz; Moussa Elkihel (Comput. Oper. Res., 2012)

A procedure-based heuristic for 0-1 Multiple Knapsack Problems. - Mohamed Esseghir Lalami; Moussa Elkihel; Didier El Baz; Vincent Boyer 002 (Int. J. Math. Oper. Res., 2012)

Recent Advances on GPU Computing in Operations Research. - Vincent Boyer 002; Didier El Baz (IPDPS Workshops, 2013)

A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem. - Vincent Boyer 002; Bernard Gendron; Louis-Martin Rousseau (J. Sched., 2014)

Training Many Neural Networks in Parallel via Back-Propagation. - Javier A. Cruz-Lopez; Vincent Boyer 002; Didier El Baz (IPDPS Workshops, 2017)

Introduction to PDCO 2018. - Grégoire Danoy; Didier El Baz; Vincent Boyer 002; Bernabé Dorronsoro (IPDPS Workshops, 2018)

Flexible job-shop scheduling problem with resource recovery constraints. - Jobish Vallikavungal Devassia; M. Angélica Salazar-Aguilar; Vincent Boyer 002 (Int. J. Prod. Res., 2018)

Multi-depot periodic vehicle routing problem with due dates and time windows. - Roberto Cantu-Funes; M. Angélica Salazar-Aguilar; Vincent Boyer 002 (J. Oper. Res. Soc., 2018)

The sales force sizing problem with multi-period workload assignments, and service time windows. - M. Angélica Salazar-Aguilar; Vincent Boyer 002; Romeo Sanchez Nigenda; Iris Abril Martínez-Salazar (Central Eur. J. Oper. Res., 2019)

A matheuristic based on Lagrangian relaxation for the multi-activity shift scheduling problem. - Noberto A. Hernández-Leandro; Vincent Boyer 002; M. Angélica Salazar-Aguilar; Louis-Martin Rousseau (Eur. J. Oper. Res., 2019)

Workshop 9: PDCO Parallel / Distributed Combinatorics and Optimization. - Grégoire Danoy; Didier El Baz; Vincent Boyer 002; Bernabé Dorronsoro; Laurence T. Yang; Keqin Li 001 (IPDPS Workshops, 2020)

The generalized flexible job shop scheduling problem. - Vincent Boyer 002; Jobish Vallikavungal; Xavier Cantú Rodríguez; M. Angélica Salazar-Aguilar (Comput. Ind. Eng., 2021)

Parallel best-first search algorithms for planning problems on multi-core processors. - Didier El Baz; Bilal Fakih; Romeo Sanchez Nigenda; Vincent Boyer 002 (J. Supercomput., 2022)

The Dial-a-Tour Problem. - Vincent Boyer 002; Erick Cervantes-Mendieta; Oscar A. Hernández-López; M. Angélica Salazar-Aguilar (Comput. Oper. Res., 2025)