9 citations · 29 across the 13 of their papers we have counts for
8 papers · 1 filter
Multi-task Representation Learning for Mixed Integer Linear Programming
Junyang Cai, Taoan Huang, Bistra Dilkina
Mixed Integer Linear Programs (MILPs) are highly flexible and powerful tools for modeling and solving complex real-world combinatorial optimization problems. Recently, machine lear…
Learning Backdoors for Mixed Integer Linear Programs with Contrastive Learning
Junyang Cai, Taoan Huang, Bistra Dilkina
Many real-world problems can be efficiently modeled as Mixed Integer Linear Programs (MILPs) and solved with the Branch-and-Bound method. Prior work has shown the existence of MILP…
Adaptive Anytime Multi-Agent Path Finding Using Bandit-Based Large Neighborhood Search
Thomy Phan, Taoan Huang, Bistra Dilkina +1
Anytime multi-agent path finding (MAPF) is a promising approach to scalable path optimization in large-scale multi-agent systems. State-of-the-art anytime MAPF is based on Large Ne…
Searching Large Neighborhoods for Integer Linear Programs with Contrastive Learning
Taoan Huang, Aaron Ferber, Yuandong Tian +2
Integer Linear Programs (ILPs) are powerful tools for modeling and solving a large number of combinatorial optimization problems. Recently, it has been shown that Large Neighborhoo…
Local Branching Relaxation Heuristics for Integer Linear Programs
Taoan Huang, Aaron Ferber, Yuandong Tian +2
Large Neighborhood Search (LNS) is a popular heuristic algorithm for solving combinatorial optimization problems (COP). It starts with an initial solution to the problem and iterat…
The (Un)Scalability of Heuristic Approximators for NP-Hard Search Problems
Sumedh Pendurkar, Taoan Huang, Sven Koenig +1
The A* algorithm is commonly used to solve NP-hard combinatorial optimization problems. When provided with a completely informed heuristic function, A* solves many NP-hard minimum-…
Learning to Resolve Conflicts for Multi-Agent Path Finding with Conflict-Based Search
Taoan Huang, Bistra Dilkina, Sven Koenig
Conflict-Based Search (CBS) is a state-of-the-art algorithm for multi-agent path finding. At the high level, CBS repeatedly detects conflicts and resolves one of them by splitting…
Dynamic Trip-Vehicle Dispatch with Scheduled and On-Demand Requests
Taoan Huang, Bohui Fang, Xiaohui Bei +1
Transportation service providers that dispatch drivers and vehicles to riders start to support both on-demand ride requests posted in real time and rides scheduled in advance, lead…