default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEdward Lam 0001
Person information
- affiliation: Monash University, Melbourne, VIC, Australia
- affiliation (PhD 2017): University of Melbourne, Parkville, VIC, Australia
Other persons with the same name
- Edward Lam 0002 — British Columbia University, Vancouver, BC, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2017
[b1]Edward Lam:
Hybrid optimization of vehicle routing problems. University of Melbourne, Parkville, Victoria, Australia, 2017
Journal Articles
- 2023
- [j7]Edward Lam
:
Hybrid optimization of vehicle routing problems. Constraints An Int. J. 28(2): 67-68 (2023) - 2022
- [j6]Edward Lam, Pierre Le Bodic, Daniel Harabor, Peter J. Stuckey:
Branch-and-cut-and-price for multi-agent path finding. Comput. Oper. Res. 144: 105809 (2022) - [j5]Edward Lam, Guy Desaulniers, Peter J. Stuckey:
Branch-and-cut-and-price for the Electric Vehicle Routing Problem with Time Windows, Piecewise-Linear Recharging and Capacitated Recharging Stations. Comput. Oper. Res. 145: 105870 (2022) - 2020
- [j4]Edward Lam, Vicky H. Mak-Hau:
Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange. Comput. Oper. Res. 115: 104852 (2020) - [j3]Edward Lam, Graeme Gange, Peter J. Stuckey, Pascal Van Hentenryck, Jip J. Dekker:
Nutmeg: a MIP and CP Hybrid Solver Using Branch-and-Check. Oper. Res. Forum 1(3) (2020) - [j2]Edward Lam, Pascal Van Hentenryck, Philip Kilby:
Joint Vehicle and Crew Routing and Scheduling. Transp. Sci. 54(2): 488-511 (2020) - 2016
- [j1]Edward Lam, Pascal Van Hentenryck:
A branch-and-price-and-check model for the vehicle routing problem with location congestion. Constraints An Int. J. 21(3): 394-412 (2016)
Conference and Workshop Papers
- 2024
- [c10]Pierre Le Bodic, Edward Lam:
Optimal Unlabeled Pebble Motion on Trees. SOCS 2024: 218-222 - 2023
- [c9]Edward Lam, Daniel Damir Harabor, Peter J. Stuckey, Jiaoyang Li:
Exact Anytime Multi-Agent Path Finding Using Branch-and-Cut-and-Price and Large Neighborhood Search. ICAPS 2023: 254-258 - 2021
- [c8]Alexey Ignatiev, Edward Lam, Peter J. Stuckey, João Marques-Silva:
A Scalable Two Stage Approach to Computing Optimal Decision Sets. AAAI 2021: 3806-3814 - [c7]Xian-Long Lee, Hong-Tzer Yang, Wen-jun Tang, Adel Nadjaran Toosi, Edward Lam:
An Adaptive Charging Scheduling for Electric Vehicles Using Multiagent Reinforcement Learning. ICSOC 2021: 273-286 - 2020
- [c6]Edward Lam, Pierre Le Bodic:
New Valid Inequalities in Branch-and-Cut-and-Price for Multi-Agent Path Finding. ICAPS 2020: 184-192 - [c5]Edward Lam, Frits de Nijs, Peter J. Stuckey, Donald Azuatalam, Ariel Liebman:
Large Neighborhood Search for Temperature Control with Demand Response. CP 2020: 603-619 - [c4]Edward Lam, Peter J. Stuckey, Sven Koenig, T. K. Satish Kumar:
Exact Approaches to the Multi-agent Collective Construction Problem. CP 2020: 743-758 - 2019
- [c3]Edward Lam, Pierre Le Bodic, Daniel Damir Harabor, Peter J. Stuckey:
Branch-and-Cut-and-Price for Multi-Agent Pathfinding. IJCAI 2019: 1289-1296 - 2017
- [c2]Edward Lam, Pascal Van Hentenryck:
Branch-and-Check with Explanations for the Vehicle Routing Problem with Time Windows. CP 2017: 579-595 - 2015
- [c1]Edward Lam, Pascal Van Hentenryck, Philip Kilby:
Joint Vehicle and Crew Routing and Scheduling. CP 2015: 654-670
Informal and Other Publications
- 2024
- [i2]Mohammed Ghannam, Gioni Mexi, Edward Lam, Ambros M. Gleixner:
Branch-and-Price for the Length-Constrained Cycle Partition Problem. CoRR abs/2401.17937 (2024) - 2021
- [i1]Alexey Ignatiev, Edward Lam, Peter J. Stuckey, João Marques-Silva:
A Scalable Two Stage Approach to Computing Optimal Decision Sets. CoRR abs/2102.01904 (2021)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-04 21:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
