Dichotomic Search Protocols for Constrained Optimization Export

@incollection{citeulike:3328672, 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.}, author = {Sellmann, Meinolf and Kadioglu, Serdar}, citeulike-article-id = {3328672}, citeulike-linkout-0 = {http://dx.doi.org/10.1007/978-3-540-85958-1_17}, doi = {10.1007/978-3-540-85958-1_17}, journal = {Principles and Practice of Constraint Programming}, keywords = {constraint-programming, convergence}, pages = {251--265}, posted-at = {2008-09-24 10:05:28}, priority = {1}, title = {Dichotomic Search Protocols for Constrained Optimization}, url = {http://dx.doi.org/10.1007/978-3-540-85958-1_17}, year = {2008} }

TY - CHAP ID - citeulike:3328672 L3 - citeulike-article-id:3328672 N2 - 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. JF - Principles and Practice of Constraint Programming EP - 265 TI - Dichotomic Search Protocols for Constrained Optimization SP - 251 KW - constraint-programming KW - convergence AU - Sellmann, Meinolf AU - Kadioglu, Serdar PY - 2008/// UR - http://dx.doi.org/10.1007/978-3-540-85958-1_17 ER -