Improved Branch and Bound for Neural Network Verification via Lagrangian Decomposition.
Alessandro De PalmaRudy BunelAlban DesmaisonKrishnamurthy DvijothamPushmeet KohliPhilip H. S. TorrM. Pawan KumarPublished in: CoRR (2021)
Keyphrases
- branch and bound
- neural network
- optimal solution
- lagrangian dual
- tree decomposition
- lower bound
- branch and bound algorithm
- search algorithm
- column generation
- upper bound
- combinatorial optimization
- search space
- branch and bound procedure
- lagrangian relaxation
- linear programming relaxation
- beam search
- search strategies
- tree search algorithm
- branch and bound method
- randomly generated problems
- network design problem
- lagrangian heuristic
- branch and bound search
- genetic algorithm
- depth first search
- tree search
- max sat
- lower and upper bounds
- model checking
- mixed integer
- integer programming problems
- tabu search
- case based reasoning