Learning Efficient Search Approximation in Mixed Integer Branch and Bound.
Kaan YilmazNeil Yorke-SmithPublished in: CoRR (2020)
Keyphrases
- branch and bound
- efficient search
- mixed integer
- lagrangian heuristic
- optimal solution
- network design problem
- upper bound
- lower bound
- combinatorial optimization
- learning algorithm
- search space
- search algorithm
- probabilistic model
- neural network
- linear programming relaxation
- reinforcement learning
- column generation
- feature selection