Lei Wu
Orcid: 0000-0001-5641-3259Affiliations:
- University of Picardie Jules Verne, Amiens, France
According to our database1,
Lei Wu
authored at least 16 papers
between 2010 and 2021.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2021
Knowl. Based Syst., 2021
2020
Discrete scenario-based optimization for the robust vehicle routing problem: The case of time windows under delay uncertainty.
Comput. Ind. Eng., 2020
2017
Design and evaluation of a parallel neighbor algorithm for the disjunctively constrained knapsack problem.
Concurr. Comput. Pract. Exp., 2017
Comput. Ind. Eng., 2017
2016
Eur. J. Oper. Res., 2016
Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium Workshops, 2016
2014
Hybrid greedy heuristics based on linear programming for the three-dimensional single bin-size bin packing problem.
Int. Trans. Oper. Res., 2014
Appl. Math. Comput., 2014
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014
A Parallel Large Neighborhood Search-Based Heuristic for the Disjunctively Constrained Knapsack Problem.
Proceedings of the 2014 IEEE International Parallel & Distributed Processing Symposium Workshops, 2014
Proceedings of the International Conference on Control, 2014
A hybrid large neighborhood search for the pickup and delivery problem with time windows.
Proceedings of the International Conference on Control, 2014
Large neighborhood search for the vehicle routing problem with two-dimensional loading constraints.
Proceedings of the International Conference on Control, 2014
2013
New models for the robust shortest path problem: complexity, resolution and generalization.
Ann. Oper. Res., 2013
2012
An equivalent Model for Exactly Solving the Multiple-choise Multidimensional Knapsack Problem.
Int. J. Comb. Optim. Probl. Informatics, 2012
2010
Electron. Notes Discret. Math., 2010