A Multiplicative Weights Update Algorithm for Packing and Covering Semi-infinite Linear Programs. - Khaled M. Elbassioni; Kazuhisa Makino; Waleed Najy (WAOA, 2016)

A Multiplicative Weight Updates Algorithm for Packing and Covering Semi-infinite Linear Programs. - Khaled M. Elbassioni; Kazuhisa Makino; Waleed Najy (Algorithmica, 2019)

The Fixed-Partition Policy Inventory Routing Problem. - Ali Diabat; Claudia Archetti; Waleed Najy (Transp. Sci., 2021)

Finding Sparse Solutions for Packing and Covering Semidefinite Programs. - Khaled M. Elbassioni; Kazuhisa Makino; Waleed Najy (SIAM J. Optim., 2022)

The drone-assisted pickup and delivery problem: An adaptive large neighborhood search metaheuristic. - Timothy Mulumba; Waleed Najy; Ali Diabat (Comput. Oper. Res., 2024)

A column generation-based matheuristic for an inventory-routing problem with driver-route consistency. - Waleed Najy; Claudia Archetti; Ali Diabat (Eur. J. Oper. Res., 2025)

Heuristic (S, T) Solutions via an FPTAS for a One-Warehouse Multiretailer Problem. - Waleed Najy; Ali Diabat; Khaled Elbassioni (Oper. Res., 2025)