Vincent Boyer

Orcid: 0000-0003-1156-6803

Affiliations:
  • Universidad Autónoma de Nuevo León, Mexico
  • Université de Montréal, Canada (2009-2012)


According to our database1, Vincent Boyer authored at least 18 papers between 2009 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Parallel best-first search algorithms for planning problems on multi-core processors.
J. Supercomput., 2022

2021
The generalized flexible job shop scheduling problem.
Comput. Ind. Eng., 2021

2020
Workshop 9: PDCO Parallel / Distributed Combinatorics and Optimization.
Proceedings of the 2020 IEEE International Parallel and Distributed Processing Symposium Workshops, 2020

2019
A matheuristic based on Lagrangian relaxation for the multi-activity shift scheduling problem.
Eur. J. Oper. Res., 2019

The sales force sizing problem with multi-period workload assignments, and service time windows.
Central Eur. J. Oper. Res., 2019

2018
Multi-depot periodic vehicle routing problem with due dates and time windows.
J. Oper. Res. Soc., 2018

Flexible job-shop scheduling problem with resource recovery constraints.
Int. J. Prod. Res., 2018

Introduction to PDCO 2018.
Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium Workshops, 2018

2017
Training Many Neural Networks in Parallel via Back-Propagation.
Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium Workshops, 2017

2014
A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem.
J. Sched., 2014

2013
Recent Advances on GPU Computing in Operations Research.
Proceedings of the 2013 IEEE International Symposium on Parallel & Distributed Processing, 2013

2012
A procedure-based heuristic for 0-1 Multiple Knapsack Problems.
Int. J. Math. Oper. Res., 2012

Solving knapsack problems on GPU.
Comput. Oper. Res., 2012

2011
A dynamic programming method with lists for the knapsack sharing problem.
Comput. Ind. Eng., 2011

Dense Dynamic Programming on Multi GPU.
Proceedings of the 19th International Euromicro Conference on Parallel, 2011

Efficient Implementation of the Simplex Method on a CPU-GPU System.
Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

Multi GPU Implementation of the Simplex Algorithm.
Proceedings of the 13th IEEE International Conference on High Performance Computing & Communication, 2011

2009
Heuristics for the 0-1 multidimensional knapsack problem.
Eur. J. Oper. Res., 2009


  Loading...