Edward Lam

Researcher in Combinatorial Optimization

Monash University

Bio

Edward is a Research Fellow in the Department of Data Science and Artificial Intelligence in the Faculty of Information Technology at Monash University, and he contributes to the Analytics and Decision Sciences program at CSIRO Data61. His research in combinatorial optimization spans the disciplines of operations research and artificial intelligence. He specializes in decompositions and hybridizations of mixed integer linear programming and constraint programming, and branch-and-cut-and-price algorithms for graph optimization problems such as shortest path problems, traveling salesmen problems and vehicle routing problems.

Prior to joining Monash University, Edward completed his PhD studies at the University of Melbourne under the supervision of Pascal Van Hentenryck from the Department of Industrial and Systems Engineering at the Georgia Institute of Technology. His thesis proposed novel techniques to hybridize mathematical programming, constraint programming and Boolean satisfiability; winning him the 2019 Doctoral Research Award from the Association for Constraint Programming.

Research Outputs

Journal Articles

  1. Lam, E., Van Hentenryck, P., & Kilby, P. (2020). Joint Vehicle and Crew Routing and Scheduling. Transportation Science. Download. Publisher.
  2. Lam, E., & Mak-Hau, V. (2020). Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange. Computers & Operations Research, 115, 104852. Download. Publisher.
  3. Lam, E., & Van Hentenryck, P. (2016). A branch-and-price-and-check model for the vehicle routing problem with location congestion. Constraints, 21(3), 394–412. Download. Publisher.

Conference Proceedings

  1. Lam, E., & Le Bodic, P. (2020). New Valid Inequalities in Branch-and-Cut-and-Price for Multi-Agent Path Finding. In Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling (ICAPS 20). Source code.
  2. Lam, E., Le Bodic, P., Harabor, D., & Stuckey, P. J. (2019). Branch-and-Cut-and-Price for Multi-Agent Pathfinding. In Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI 19) (pp. 1289–1296). International Joint Conferences on Artificial Intelligence Organization. Download. Publisher. Source code.
  3. Lam, E., & Van Hentenryck, P. (2017). Branch-and-Check with Explanations for the Vehicle Routing Problem with Time Windows. In J. C. Beck (Ed.), Principles and Practice of Constraint Programming: 23rd International Conference, CP 2017, Melbourne, VIC, Australia, August 28 – September 1, 2017, Proceedings (pp. 579–595). Springer, Cham. Download. Publisher.
  4. Lam, E., Van Hentenryck, P., & Kilby, P. (2015). Joint Vehicle and Crew Routing and Scheduling. In G. Pesant (Ed.), Principles and Practice of Constraint Programming: 21st International Conference, CP 2015, Cork, Ireland, August 31 – September 4, 2015, Proceedings (pp. 654–670). Springer, Cham. Download. Publisher.

PhD Thesis

  1. Lam, E. (2017). Hybrid optimization of vehicle routing problems. University of Melbourne. Download. University archive.

Other Downloads

Contact Details