A Linear Programming Approach for the Three-Dimensional Bin-Packing Problem. - Mhand Hifi; Imed Kacem; Stéphane Nègre; Lei Wu 005 (Electron. Notes Discret. Math., 2010)

An equivalent Model for Exactly Solving the Multiple-choise Multidimensional Knapsack Problem. - Mhand Hifi; Lei Wu 005 (Int. J. Comb. Optim. Probl. Informatics, 2012)

New models for the robust shortest path problem: complexity, resolution and generalization. - Virginie Gabrel; Cécile Murat; Lei Wu 005 (Ann. Oper. Res., 2013)

Large neighborhood search for the vehicle routing problem with two-dimensional loading constraints. - Moudher Kh. Abdal-Hammed; Mhand Hifi; Lei Wu 005 (CoDIT, 2014)

A hybrid large neighborhood search for the pickup and delivery problem with time windows. - Mhand Hifi; Laurent Moreau; Stéphane Nègre; Lei Wu 005 (CoDIT, 2014)

A hybrid metaheuristic for the Vehicle Routing Problem with Time Windows. - Mhand Hifi; Lei Wu 005 (CoDIT, 2014)

A Parallel Large Neighborhood Search-Based Heuristic for the Disjunctively Constrained Knapsack Problem. - Mhand Hifi; Stéphane Nègre; Toufik Saadi; Sagvan Saleh; Lei Wu 005 (IPDPS Workshops, 2014)

A Fast Large Neighborhood Search for Disjunctively Constrained Knapsack Problems. - Mhand Hifi; Sagvan Saleh; Lei Wu 005 (ISCO, 2014)

New upper bounds and exact methods for the knapsack sharing problem. - Mhand Hifi; Lei Wu 005 (Appl. Math. Comput., 2014)

Hybrid greedy heuristics based on linear programming for the three-dimensional single bin-size bin packing problem. - Mhand Hifi; Stéphane Nègre; Lei Wu 005 (Int. Trans. Oper. Res., 2014)

A Parallel Ant Colony Optimization for the Maximum-Weight Clique Problem. - Didier El Baz; Mhand Hifi; Lei Wu 005; Xiaochuan Shi (IPDPS Workshops, 2016)

An exact decomposition algorithm for the generalized knapsack sharing problem. - Isma Dahmani; Mhand Hifi; Lei Wu 005 (Eur. J. Oper. Res., 2016)

A new robust criterion for the vehicle routing problem with uncertain travel time. - Lei Wu 005; Mhand Hifi; Hiba Bederina (Comput. Ind. Eng., 2017)

Design and evaluation of a parallel neighbor algorithm for the disjunctively constrained knapsack problem. - Zhe Quan; Lei Wu 005 (Concurr. Comput. Pract. Exp., 2017)

Discrete scenario-based optimization for the robust vehicle routing problem: The case of time windows under delay uncertainty. - Lei Wu 005; Mhand Hifi (Comput. Ind. Eng., 2020)

Data-driven robust optimization for the itinerary planning via large-scale GPS data. - Lei Wu 005; Mhand Hifi (Knowl. Based Syst., 2021)