default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTaoan Huang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j2]Weiran Shen
, Minbiao Han, Weizhe Chen, Taoan Huang, Rohit Singh, Haifeng Xu, Fei Fang:
An extensive study of security games with strategic informants. Artif. Intell. 334: 104162 (2024)- [c20]Thomy Phan, Taoan Huang, Bistra Dilkina, Sven Koenig:
Adaptive Anytime Multi-Agent Path Finding Using Bandit-Based Large Neighborhood Search. AAAI 2024: 17514-17522 - [c19]Junyang Cai, Taoan Huang, Bistra Dilkina:
Learning Backdoors for Mixed Integer Linear Programs with Contrastive Learning. ECAI 2024: 2418-2425 - [c18]Aaron M. Ferber, Arman Zharmagambetov, Taoan Huang, Bistra Dilkina, Yuandong Tian:
GenCO: Generating Diverse Designs with Combinatorial Constraints. ICML 2024 - [c17]Taoan Huang, Aaron M. Ferber, Arman Zharmagambetov, Yuandong Tian, Bistra Dilkina:
Contrastive Predict-and-Search for Mixed Integer Linear Programs. ICML 2024 - [i12]Junyang Cai, Taoan Huang, Bistra Dilkina:
Learning Backdoors for Mixed Integer Programs with Contrastive Learning. CoRR abs/2401.10467 (2024) - [i11]Weimin Huang, Taoan Huang, Aaron M. Ferber, Bistra Dilkina:
Distributional MIPLIB: a Multi-Domain Library for Advancing ML-Guided MILP Methods. CoRR abs/2406.06954 (2024) - 2023
- [j1]Sumedh Pendurkar, Taoan Huang, Brendan Juba, Jiapeng Zhang, Sven Koenig, Guni Sharon:
The (Un)Scalability of Informed Heuristic Function Estimation in NP-Hard Search Problems. Trans. Mach. Learn. Res. 2023 (2023) - [c16]Shuwei Wang, Vadim Bulitko, Taoan Huang, Sven Koenig, Roni Stern:
Synthesizing Priority Planning Formulae for Multi-Agent Pathfinding. AIIDE 2023: 360-369 - [c15]Taoan Huang, Vikas Shivashankar, Michael Caldara, Joseph W. Durham, Jiaoyang Li, Bistra Dilkina, Sven Koenig:
Deadline-Aware Multi-Agent Tour Planning. ICAPS 2023: 189-197 - [c14]Taoan Huang, Aaron M. Ferber, Yuandong Tian, Bistra Dilkina, Benoit Steiner:
Local Branching Relaxation Heuristics for Integer Linear Programs. CPAIOR 2023: 96-113 - [c13]Aaron M. Ferber, Taoan Huang, Daochen Zha, Martin Schubert, Benoit Steiner, Bistra Dilkina, Yuandong Tian:
SurCo: Learning Linear SURrogates for COmbinatorial Nonlinear Optimization Problems. ICML 2023: 10034-10052 - [c12]Taoan Huang, Aaron M. Ferber, Yuandong Tian, Bistra Dilkina, Benoit Steiner:
Searching Large Neighborhoods for Integer Linear Programs with Contrastive Learning. ICML 2023: 13869-13890 - [c11]Arman Zharmagambetov, Brandon Amos, Aaron M. Ferber, Taoan Huang, Bistra Dilkina, Yuandong Tian:
Landscape Surrogate: Learning Decision Losses for Mathematical Optimization Under Partial Information. NeurIPS 2023 - [i10]Taoan Huang, Aaron M. Ferber, Yuandong Tian, Bistra Dilkina, Benoit Steiner:
Searching Large Neighborhoods for Integer Linear Programs with Contrastive Learning. CoRR abs/2302.01578 (2023) - [i9]Arman Zharmagambetov, Brandon Amos, Aaron M. Ferber, Taoan Huang, Bistra Dilkina, Yuandong Tian:
Landscape Surrogate: Learning Decision Losses for Mathematical Optimization Under Partial Information. CoRR abs/2307.08964 (2023) - [i8]Aaron M. Ferber, Arman Zharmagambetov, Taoan Huang, Bistra Dilkina, Yuandong Tian:
GenCO: Generating Diverse Solutions to Design Problems with Combinatorial Nature. CoRR abs/2310.02442 (2023) - [i7]Thomy Phan, Taoan Huang, Bistra Dilkina, Sven Koenig:
Adaptive Anytime Multi-Agent Path Finding Using Bandit-Based Large Neighborhood Search. CoRR abs/2312.16767 (2023) - 2022
- [c10]Taoan Huang, Jiaoyang Li, Sven Koenig, Bistra Dilkina:
Anytime Multi-Agent Path Finding via Machine Learning-Guided Large Neighborhood Search. AAAI 2022: 9368-9376 - [c9]Shuyang Zhang, Jiaoyang Li, Taoan Huang, Sven Koenig, Bistra Dilkina:
Learning a Priority Ordering for Prioritized Planning in Multi-Agent Path Finding. SOCS 2022: 208-216 - [c8]Sumedh Pendurkar, Taoan Huang, Sven Koenig, Guni Sharon:
A Discussion on the Scalability of Heuristic Approximators (Extended Abstract). SOCS 2022: 311-313 - [i6]Sumedh Pendurkar, Taoan Huang, Sven Koenig, Guni Sharon:
The (Un)Scalability of Heuristic Approximators for NP-Hard Search Problems. CoRR abs/2209.03393 (2022) - [i5]Aaron M. Ferber, Taoan Huang, Daochen Zha, Martin Schubert, Benoit Steiner, Bistra Dilkina, Yuandong Tian:
SurCo: Learning Linear Surrogates For Combinatorial Nonlinear Optimization Problems. CoRR abs/2210.12547 (2022) - [i4]Taoan Huang, Aaron M. Ferber, Yuandong Tian, Bistra Dilkina, Benoit Steiner:
Local Branching Relaxation Heuristics for Integer Linear Programs. CoRR abs/2212.08183 (2022) - 2021
- [c7]Taoan Huang, Sven Koenig, Bistra Dilkina:
Learning to Resolve Conflicts for Multi-Agent Path Finding with Conflict-Based Search. AAAI 2021: 11246-11253 - [c6]Taoan Huang, Bistra Dilkina, Sven Koenig:
Learning Node-Selection Strategies in Bounded-Suboptimal Conflict-Based Search for Multi-Agent Path Finding. AAMAS 2021: 611-619 - 2020
- [c5]Taoan Huang, Weiran Shen, David Zeng, Tianyu Gu, Rohit Singh, Fei Fang:
Green Security Game with Community Engagement. AAMAS 2020: 529-537 - [c4]Taoan Huang, Bistra Dilkina:
Enhancing Seismic Resilience of Water Pipe Networks. COMPASS 2020: 44-52 - [c3]Weiran Shen, Weizhe Chen, Taoan Huang, Rohit Singh, Fei Fang:
When to Follow the Tip: Security Games with Strategic Informants. IJCAI 2020: 371-377 - [i3]Taoan Huang, Weiran Shen, David Zeng, Tianyu Gu, Rohit Singh, Fei Fang:
Green Security Game with Community Engagement. CoRR abs/2002.09126 (2020) - [i2]Taoan Huang, Bistra Dilkina, Sven Koenig:
Learning to Resolve Conflicts for Multi-Agent Path Finding with Conflict-Based Search. CoRR abs/2012.06005 (2020)
2010 – 2019
- 2019
- [c2]Taoan Huang, Bohui Fang, Hoon Oh, Xiaohui Bei, Fei Fang:
Optimal Trip-Vehicle Dispatch with Multi-Type Requests. AAMAS 2019: 2024-2026 - [c1]Taoan Huang, Bohui Fang, Xiaohui Bei, Fei Fang:
Dynamic Trip-Vehicle Dispatch with Scheduled and On-Demand Requests. UAI 2019: 250-260 - [i1]Taoan Huang, Bohui Fang, Xiaohui Bei, Fei Fang:
Dynamic Trip-Vehicle Dispatch with Scheduled and On-Demand Requests. CoRR abs/1907.08739 (2019)
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-10-28 20:10 CET 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:
