1.1k citations · 1.4k across the 52 of their papers we have counts for
4 papers · 2 filters
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…
Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem
Junyang Cai, Serdar Kadioglu, Bistra Dilkina
Mixed-integer programming (MIP) is a powerful paradigm for modeling and solving various important combinatorial optimization problems. Recently, learning-based approaches have show…
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…