Vincent Boyer

20 papers C 2Journal 13Unranked 5
YearRankTypeTitle / Venue / Authors
2026 J jnl
Branch and cut for the team orienteering problem with nonidentical agents and balanced score.
Expert Syst. Appl.
Vincent Boyer, Gabriela Sánchez-Yepez, M. Angélica Salazar-Aguilar
2025 J jnl
The Dial-a-Tour Problem.
Comput. Oper. Res.
Vincent Boyer, Erick Cervantes-Mendieta, Oscar A. Hernández-López, M. Angélica Salazar-Aguilar
2022 J jnl
Parallel best-first search algorithms for planning problems on multi-core processors.
J. Supercomput.
Didier El Baz, Bilal Fakih, Romeo Sanchez Nigenda, Vincent Boyer
2021 J jnl
The generalized flexible job shop scheduling problem.
Comput. Ind. Eng.
Vincent Boyer, Jobish Vallikavungal, Xavier Cantú Rodríguez, M. Angélica Salazar-Aguilar
2020 — conf
Workshop 9: PDCO Parallel / Distributed Combinatorics and Optimization.
IPDPS Workshops
Grégoire Danoy, Didier El Baz, Vincent Boyer, Bernabé Dorronsoro, Laurence T. Yang, Keqin Li
2019 J jnl
A matheuristic based on Lagrangian relaxation for the multi-activity shift scheduling problem.
Eur. J. Oper. Res.
Noberto A. Hernández-Leandro, Vincent Boyer, M. Angélica Salazar-Aguilar, Louis-Martin Rousseau
2019 J jnl
The sales force sizing problem with multi-period workload assignments, and service time windows.
Central Eur. J. Oper. Res.
M. Angélica Salazar-Aguilar, Vincent Boyer, Romeo Sanchez Nigenda, Iris Abril Martínez-Salazar
2018 J jnl
Flexible job-shop scheduling problem with resource recovery constraints.
Int. J. Prod. Res.
Jobish Vallikavungal Devassia, M. Angélica Salazar-Aguilar, Vincent Boyer
2018 — conf
Introduction to PDCO 2018.
IPDPS Workshops
Grégoire Danoy, Didier El Baz, Vincent Boyer, Bernabé Dorronsoro
2018 J jnl
Multi-depot periodic vehicle routing problem with due dates and time windows.
J. Oper. Res. Soc.
Roberto Cantu-Funes, M. Angélica Salazar-Aguilar, Vincent Boyer
2017 — conf
Training Many Neural Networks in Parallel via Back-Propagation.
IPDPS Workshops
Javier A. Cruz-Lopez, Vincent Boyer, Didier El Baz
2014 J jnl
A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem.
J. Sched.
Vincent Boyer, Bernard Gendron, Louis-Martin Rousseau
2013 — conf
Recent Advances on GPU Computing in Operations Research.
IPDPS Workshops
Vincent Boyer, Didier El Baz
2012 J jnl
A procedure-based heuristic for 0-1 Multiple Knapsack Problems.
Int. J. Math. Oper. Res.
Mohamed Esseghir Lalami, Moussa Elkihel, Didier El Baz, Vincent Boyer
2012 J jnl
Solving knapsack problems on GPU.
Comput. Oper. Res.
Vincent Boyer, Didier El Baz, Moussa Elkihel
2011 J jnl
A dynamic programming method with lists for the knapsack sharing problem.
Comput. Ind. Eng.
Vincent Boyer, Didier El Baz, Moussa Elkihel
2011 C conf
Dense Dynamic Programming on Multi GPU.
PDP
Vincent Boyer, Didier El Baz, Moussa Elkihel
2011 — conf
Efficient Implementation of the Simplex Method on a CPU-GPU System.
IPDPS Workshops
Mohamed Esseghir Lalami, Vincent Boyer, Didier El Baz
2011 C conf
Multi GPU Implementation of the Simplex Algorithm.
HPCC
Mohamed Esseghir Lalami, Didier El Baz, Vincent Boyer
2009 J jnl
Heuristics for the 0-1 multidimensional knapsack problem.
Eur. J. Oper. Res.
Vincent Boyer, Moussa Elkihel, Didier El Baz