A branch-and-price-and-check model for the vehicle routing problem with location congestion. - Edward Lam 001; Pascal Van Hentenryck (Constraints An Int. J., 2016)

Branch-and-Check with Explanations for the Vehicle Routing Problem with Time Windows. - Edward Lam 001; Pascal Van Hentenryck (CP, 2017)

Hybrid optimization of vehicle routing problems. - Edward Lam 001 (2017)

Branch-and-Cut-and-Price for Multi-Agent Pathfinding. - Edward Lam 001; Pierre Le Bodic; Daniel Damir Harabor; Peter J. Stuckey (IJCAI, 2019)

New Valid Inequalities in Branch-and-Cut-and-Price for Multi-Agent Path Finding. - Edward Lam 001; Pierre Le Bodic (ICAPS, 2020)

Large Neighborhood Search for Temperature Control with Demand Response. - Edward Lam 001; Frits de Nijs; Peter J. Stuckey; Donald Azuatalam; Ariel Liebman (CP, 2020)

Exact Approaches to the Multi-agent Collective Construction Problem. - Edward Lam 001; Peter J. Stuckey; Sven Koenig; T. K. Satish Kumar (CP, 2020)

Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange. - Edward Lam 001; Vicky H. Mak-Hau (Comput. Oper. Res., 2020)

Nutmeg: a MIP and CP Hybrid Solver Using Branch-and-Check. - Edward Lam 001; Graeme Gange; Peter J. Stuckey; Pascal Van Hentenryck; Jip J. Dekker (Oper. Res. Forum, 2020)

Joint Vehicle and Crew Routing and Scheduling. - Edward Lam 001; Pascal Van Hentenryck; Philip Kilby (Transp. Sci., 2020)

A Scalable Two Stage Approach to Computing Optimal Decision Sets. - Alexey Ignatiev; Edward Lam 001; Peter J. Stuckey; João Marques-Silva 001 (AAAI, 2021)

An Adaptive Charging Scheduling for Electric Vehicles Using Multiagent Reinforcement Learning. - Xian-Long Lee; Hong-Tzer Yang; Wen-jun Tang; Adel Nadjaran Toosi; Edward Lam 001 (ICSOC, 2021)

Branch-and-cut-and-price for multi-agent path finding. - Edward Lam 001; Pierre Le Bodic; Daniel Harabor; Peter J. Stuckey (Comput. Oper. Res., 2022)

Branch-and-cut-and-price for the Electric Vehicle Routing Problem with Time Windows, Piecewise-Linear Recharging and Capacitated Recharging Stations. - Edward Lam 001; Guy Desaulniers; Peter J. Stuckey (Comput. Oper. Res., 2022)

Exact Anytime Multi-Agent Path Finding Using Branch-and-Cut-and-Price and Large Neighborhood Search. - Edward Lam 001; Daniel Damir Harabor; Peter J. Stuckey; Jiaoyang Li 001 (ICAPS, 2023)

Hybrid optimization of vehicle routing problems. - Edward Lam 001 (Constraints An Int. J., 2023)

Optimal Unlabeled Pebble Motion on Trees. - Pierre Le Bodic; Edward Lam 001 (SOCS, 2024)

Branch-and-Price for the Length-Constrained Cycle Partition Problem. - Mohammed Ghannam; Gioni Mexi; Edward Lam 001; Ambros M. Gleixner (CoRR, 2024)