22 citations · 38 across the 7 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
math.OC2020
Quasi Branch and Bound for Smooth Global Optimization
Nadav Dym
Quasi branch and bound is a recently introduced generalization of branch and bound, where lower bounds are replaced by a relaxed notion of quasi-lower bounds, required to be lower…
math.OC2017
Exact Recovery with Symmetries for the Doubly-Stochastic Relaxation
Nadav Dym
Graph matching or quadratic assignment, is the problem of labeling the vertices of two graphs so that they are as similar as possible. A common method for approximately solving the…