Search Results for author:
Found 3 papers, 1 papers with code
Branch Ranking for Efficient Mixed-Integer Programming via Offline Ranking-based Policy Learning
Deriving a good variable selection strategy in branch-and-bound is essential for the efficiency of modern mixed-integer programming (MIP) solvers.
Learning to Select Cuts for Efficient Mixed-Integer Programming
In the online A/B testing of the product planning problems with more than $10^7$ variables and constraints daily, Cut Ranking has achieved the average speedup ratio of 12. 42% over the production solver without any accuracy loss of solution.
Bi-level Actor-Critic for Multi-agent Coordination
Coordination is one of the essential problems in multi-agent systems.
Multiagent Systems
Cannot find the paper you are looking for? You can
Submit a new open access paper.
