We devise a theoretical model for dichotomic search algorithms for constrained optimization. We show that, within our model, a certain way of choosing the breaking point minimizes both expected as well as worst case performance in a skewed binary search. Furthermore, we show that our protocol is optimal in the expected and in the worst case. Experimental results illustrate performance gains when our protocols are used within the search strategy by Streeter and Smith. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Sellmann, M., & Kadioglu, S. (2008). Dichotomic search protocols for constrained optimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5202 LNCS, pp. 251–265). https://doi.org/10.1007/978-3-540-85958-1_17
Mendeley helps you to discover research relevant for your work.