default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLei Wu 0005
Person information
- affiliation: University of Picardie Jules Verne, Amiens, France
Other persons with the same name
- Lei Wu (aka: Wu Lei) — disambiguation page
- Lei Wu 0001 — Rochester Institute of Technology, Software Engineering Department, College of Computing and Information Science, NY, USA
- Lei Wu 0002
![[0000-0002-3872-9062]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-3872-9062")
— Shandong University, School of Computer Science and Technology, Jinan, China - Lei Wu 0003 — University of Strathclyde, Department of Mechanical and Aerospace Engineering, James Weir Fluids Laboratory, Glasgow, UK
- Lei Wu 0004 — Stevens Institute of Technology, Hoboken, NJ, USA (and 2 more)
- Lei Wu 0006 — University of Alberta, Department of Physics, Edmonton, AB, Canada
- Lei Wu 0007 — Southeast University, School of Instrument Science and Engineering, Nanjing, China (and 1 more)
- Lei Wu 0008 — University of Stuttgart, Germany
- Lei Wu 0009 — Texas A&M University, College Station, USA
- Lei Wu 0010 — Huazhong University of Science and Technology, School of Computer Science and Technology, Wuhan, China
- Lei Wu 0011 — Shandong Normal University, School of Information Science and Engineering, Jinan, China
- Lei Wu 0012 — Zhejiang University, Hangzhou, Zhejiang, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j10]Lei Wu, Mhand Hifi:
Data-driven robust optimization for the itinerary planning via large-scale GPS data. Knowl. Based Syst. 231: 107437 (2021)- 2020
- [j9]Lei Wu, Mhand Hifi:
Discrete scenario-based optimization for the robust vehicle routing problem: The case of time windows under delay uncertainty. Comput. Ind. Eng. 145: 106491 (2020)
2010 – 2019
- 2017
- [j8]Lei Wu, Mhand Hifi, Hiba Bederina:
A new robust criterion for the vehicle routing problem with uncertain travel time. Comput. Ind. Eng. 112: 607-615 (2017) - [j7]Zhe Quan, Lei Wu:
Design and evaluation of a parallel neighbor algorithm for the disjunctively constrained knapsack problem. Concurr. Comput. Pract. Exp. 29(20) (2017) - 2016
- [j6]Isma Dahmani, Mhand Hifi, Lei Wu:
An exact decomposition algorithm for the generalized knapsack sharing problem. Eur. J. Oper. Res. 252(3): 761-774 (2016) - [c6]Didier El Baz, Mhand Hifi, Lei Wu, Xiaochuan Shi:
A Parallel Ant Colony Optimization for the Maximum-Weight Clique Problem. IPDPS Workshops 2016: 796-800 - 2014
- [j5]Mhand Hifi, Lei Wu:
New upper bounds and exact methods for the knapsack sharing problem. Appl. Math. Comput. 227: 518-530 (2014) - [j4]Mhand Hifi, Stéphane Nègre, Lei Wu:
Hybrid greedy heuristics based on linear programming for the three-dimensional single bin-size bin packing problem. Int. Trans. Oper. Res. 21(1): 59-79 (2014) - [c5]Moudher Kh. Abdal-Hammed, Mhand Hifi, Lei Wu:
Large neighborhood search for the vehicle routing problem with two-dimensional loading constraints. CoDIT 2014: 54-59 - [c4]Mhand Hifi, Laurent Moreau, Stéphane Nègre, Lei Wu:
A hybrid large neighborhood search for the pickup and delivery problem with time windows. CoDIT 2014: 104-109 - [c3]Mhand Hifi, Lei Wu:
A hybrid metaheuristic for the Vehicle Routing Problem with Time Windows. CoDIT 2014: 188-194 - [c2]Mhand Hifi, Stéphane Nègre, Toufik Saadi, Sagvan Saleh, Lei Wu:
A Parallel Large Neighborhood Search-Based Heuristic for the Disjunctively Constrained Knapsack Problem. IPDPS Workshops 2014: 1547-1551 - [c1]Mhand Hifi, Sagvan Saleh, Lei Wu:
A Fast Large Neighborhood Search for Disjunctively Constrained Knapsack Problems. ISCO 2014: 396-407 - 2013
- [j3]Virginie Gabrel, Cécile Murat, Lei Wu:
New models for the robust shortest path problem: complexity, resolution and generalization. Ann. Oper. Res. 207(1): 97-120 (2013) - 2012
- [j2]Mhand Hifi, Lei Wu:
An equivalent Model for Exactly Solving the Multiple-choise Multidimensional Knapsack Problem. Int. J. Comb. Optim. Probl. Informatics 3(3): 43-58 (2012) - 2010
- [j1]Mhand Hifi, Imed Kacem, Stéphane Nègre, Lei Wu:
A Linear Programming Approach for the Three-Dimensional Bin-Packing Problem. Electron. Notes Discret. Math. 36: 993-1000 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-30 21:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
