In computer science, binary search, also known as half-interval search, logarithmic search, or binary chop, is a search algorithm that finds the position of a target value within a sorted array.

Abstract: This paper presents a binary search algorithm to deal with binary variables in mixed integer optimization problems. One example of this kind of problem is the optimal operation of hydrogen ...