Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
1805.03876
Cited By
Learning Robust Search Strategies Using a Bandit-Based Approach
10 May 2018
Wei Xia
R. Yap
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Learning Robust Search Strategies Using a Bandit-Based Approach"
6 / 6 papers shown
Title
Learning a Generic Value-Selection Heuristic Inside a Constraint Programming Solver
Tom Marty
Tristan François
Pierre Tessier
Louis Gautier
Louis-Martin Rousseau
Quentin Cappart
106
7
0
05 Jan 2023
Structural Analysis of Branch-and-Cut and the Learnability of Gomory Mixed Integer Cuts
Maria-Florina Balcan
Siddharth Prasad
Tuomas Sandholm
Ellen Vitercik
42
22
0
15 Apr 2022
Sample Complexity of Tree Search Configuration: Cutting Planes and Beyond
Maria-Florina Balcan
Siddharth Prasad
Tuomas Sandholm
Ellen Vitercik
63
39
0
08 Jun 2021
Combining Reinforcement Learning and Constraint Programming for Combinatorial Optimization
Quentin Cappart
Thierry Moisan
Louis-Martin Rousseau
Isabeau Prémont-Schwarz
A. Ciré
87
145
0
02 Jun 2020
Learning to Optimize Computational Resources: Frugal Training with Generalization Guarantees
Maria-Florina Balcan
Tuomas Sandholm
Ellen Vitercik
70
16
0
26 May 2019
Learning to Branch
Maria-Florina Balcan
Travis Dick
Tuomas Sandholm
Ellen Vitercik
90
173
0
27 Mar 2018
1