Lei WU

Lei WU

orcid

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 August 2010 in Electronic Notes in Discrete Mathematics
Verified
Journal Article
Closed access
MHMhand Hifi
Mhand Hifi
Imed KacemImed Kacem
Imed Kacem
SNStéphane Nègre
Stéphane Nègre
LWLei WU
Lei WU

13 October 2011 in Annals of Operations Research
Verified
Journal Article
Closed access
PDF file
VGVirginie Gabrel
Virginie Gabrel
CMCécile Murat
Cécile Murat
LWLei WU
Lei WU

1 October 2017 in Computers & Industrial Engineering
Verified
Journal Article
Closed access
LWLei WU
Lei WU
MHMhand Hifi
Mhand Hifi
HBHiba Bederina
Hiba Bederina

27 June 2023 in Finance Research Letters
Verified
Journal Article
Closed access
LWLei WU
Lei WU
DYDongli Yu
Dongli Yu
YLYongbin Lv
Yongbin Lv

9 December 2013 in International Transactions in Operational Research
Verified
Journal Article
Closed access
PDF file
MHMhand Hifi
Mhand Hifi
SNStéphane Negre
Stéphane Negre
LWLei WU
Lei WU

9 February 2017 in Sustainability
Verified
Journal Article
Open access
PDF file
XSXiaochuan Shi
Xiaochuan Shi
LWLei WU
Lei WU
XMXiaoliang Meng
Xiaoliang Meng
New information technology constantly improves the efficiency of social networks. Using optimization and decision models in the context of large data sets attracts extensive attention. This paper investigates a novel mathematical model for designing and optimizing environmental economic policies in a protection zone. The proposed model is referred to as the quadratic knapsack problem with conflict graphs, which is a new variant of the knapsack problem family. Due to the investigated problem processing a high complex structure, in order to solve efficiently the problem, we develop a metaheuristic which is based on the large neighborhood search. The proposed method embeds a construction procedure into a sophistical neighborhood search. For more details, the construction procedure takes charge of finding a starting solution while the investigated neighborhood search is used to generate and explore the solution space issuing from the provided starting solution. In order to highlight our theoretical model, we evaluate the model on a set of complex benchmark data sets. The obtained results demonstrate that the investigated algorithm is competitive and efficient compared to legacy algorithms.