Dichotomic Search Protocols for Constrained Optimization

Abstract. 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.

• Type: Conference
• Year: 2008
• Where: CP
• Authors: Meinolf Sellmann, Serdar Kadioglu
• Keywords: Artificial Intelligence, CP 2008, Dichotomic Search Algorithms, Worst Case, Worst Case Performance