Click here for Edward's personal webpage.
- E. Lam, D. Harabor, P. Stuckey and J. Li. Exact Anytime Multi-Agent Path Finding Using Branch-and-Cut-and-Price and Large Neighborhood Search. In Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS), 2023.
- E. Lam, P. Le Bodic, D. Harabor and P. Stuckey. Branch-and-Cut-and-Price for Multi-Agent Path Finding. Computers and Operations Research, 2022.
- E. Lam and P. Le Bodic. New Valid Inequalities in Branch-and-Cut-and-Price for Multi-Agent Path Finding. In Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS), 184-192, 2020.
- E. Lam, P. Le Bodic, D. Harabor and P. Stuckey. Branch-and-Cut-and-Price for Multi-Agent Pathfinding. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), (in print), 2019.
