Minimize rational-linear fraction function efficiently

Question

I need to find minimum positive value of this function, where a_i and b_i are real constants and all s_i are equal to plus or minus one:

I can make it in ~n*2^n operations by brute force complete search, but is it possible to do it faster? It might be a known problem, but I don't know how to google it.