Edward Lam

Orcid: 0000-0002-4485-5014

Affiliations:
  • Monash University, Melbourne, VIC, Australia
  • University of Melbourne, Parkville, VIC, Australia (PhD 2017)


According to our database1, Edward Lam authored at least 17 papers between 2016 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Branch-and-Price for the Length-Constrained Cycle Partition Problem.
CoRR, 2024

2023
Hybrid optimization of vehicle routing problems.
Constraints An Int. J., 2023

Exact Anytime Multi-Agent Path Finding Using Branch-and-Cut-and-Price and Large Neighborhood Search.
Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

2022
Branch-and-cut-and-price for the Electric Vehicle Routing Problem with Time Windows, Piecewise-Linear Recharging and Capacitated Recharging Stations.
Comput. Oper. Res., 2022

Branch-and-cut-and-price for multi-agent path finding.
Comput. Oper. Res., 2022

2021
An Adaptive Charging Scheduling for Electric Vehicles Using Multiagent Reinforcement Learning.
Proceedings of the Service-Oriented Computing - 19th International Conference, 2021

A Scalable Two Stage Approach to Computing Optimal Decision Sets.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Joint Vehicle and Crew Routing and Scheduling.
Transp. Sci., 2020

Nutmeg: a MIP and CP Hybrid Solver Using Branch-and-Check.
Oper. Res. Forum, 2020

Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange.
Comput. Oper. Res., 2020

Exact Approaches to the Multi-agent Collective Construction Problem.
Proceedings of the Principles and Practice of Constraint Programming, 2020

Large Neighborhood Search for Temperature Control with Demand Response.
Proceedings of the Principles and Practice of Constraint Programming, 2020

New Valid Inequalities in Branch-and-Cut-and-Price for Multi-Agent Path Finding.
Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, 2020

2019
Branch-and-Cut-and-Price for Multi-Agent Pathfinding.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

2017
Hybrid optimization of vehicle routing problems.
PhD thesis, 2017

Branch-and-Check with Explanations for the Vehicle Routing Problem with Time Windows.
Proceedings of the Principles and Practice of Constraint Programming, 2017

2016
A branch-and-price-and-check model for the vehicle routing problem with location congestion.
Constraints An Int. J., 2016


  Loading...