Dichotomic search protocols for constrained optimization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5202 LNCS, Issue , 2008, Pages 251-265

  Sellmann, Meinolf ^a   Kadioglu, Serdar ^a  

^a Brown Univerity   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY SEARCHES; BREAKING POINTS; PERFORMANCE GAINS; SEARCH ALGORITHMS; SEARCH PROTOCOLS; SEARCH STRATEGIES; THEORETICAL MODELS; WORST CASES;

COMPUTER NETWORKS; COMPUTER PROGRAMMING; CONSTRAINT THEORY; LEARNING ALGORITHMS; OPTIMIZATION;

CONSTRAINED OPTIMIZATION;

EID: 56449116924     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85958-1_17     Document Type: Conference Paper

References (20)

1. Brodai, G.S., Moruz, G.: Skewed Binary Search Trees. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 708-719. Springer, Heidelberg (2006)
2. Crawford, J.A., Auton, L.D.: Experimental Results on the Cross-Over Point in Random 3-SAT. Artificial Intelligence 81, 31-57 (1996)
3. Fahle, T., Schamberger, S., Sellmann, M.: Symmetry Breaking. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 93-107. Springer, Heidelberg (2001)
4. Ferré, S., King, R.D.: A dichotomic search algorithm for mining and learning in domain-specific logics. Fundamenta Informaticae 66(1-2), 1-32 (2005)
5. Focacci, F., Lodi, A., Milano, M.: Cost-Based Domain Filtering. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 189-203. Springer, Heidelberg (1999)
6. Focacci, F., Milano, M.: Global Cut Framework for Removing Symmetries. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 77-92. Springer, Heidelberg (2001)
7. Gomes, C.P., Selman, B., Crato, N., Kautz, H.: Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. Automated Reasoning 24(1-2), 67-100 (2000)
8. Harvey, W.: Symmetry Breaking and the Social Golfer Problem. In: SymCon. (2001)
9. Hogg, T., Huberman, B.A., Williams, C.P.: Phase Transitions and Complexity. Artificial Intelligence 81 (1996)
10. Jussien, N., Lhomme, O.: Dynamic Domain Splitting for Numeric CSPs. In: ECAI, pp. 224-228 (1998)
11. Kirkpatrick, S., Selman, B.: Critical Behavior in the Satisfiability of Random Boolean Expressions. Science 264, 1297-1301 (1994)
12. Leong, G.T.: Constraint Programming for the Traveling Tournament Problem. Project Thesis, National University of Singapore (2003)
13. Lustig, I., Puget, J.-F.: Constraint Programming. Encyclopedia of Operations Research and Management Science, 136-140 (2001)
14. Monasson, R., Zecchina, R., Kirkpatrick, S., Selman, B., Troyansky, L.: Determining computational complexity from characteristic 'phase transitions'. Nature 400, 133-137 (1999)
15. Nievergelt, J., Reingold, E.M.: Binary search trees of bounded balance. In: Annual ACM Symposium on Theory of Computing, pp. 137-142 (1972)
16. Smith, B.: Reducing Symmetry in a Combinatorial Design Problem. In: CPAIOR, pp. 351-360 (2001)
17. Streeter, M., Smith, S.F.: Using Decision Procedures Efficiently for Optimization. In: ICAPS, pp. 312-319 (2007)
18. Wojtaszek, D., Chinneck, J.W.: Faster MIP Solutions via New Node Selection Rules. In: INFORMS (2007)
19. Wong, C.K., Nievergelt, J.: Upper Bounds for the Total Path Length of Binary Trees. Journal of the ACM 20(f), 1-6 (1973)
20. Zhang, H.: Specifying Latin Square Problems in Propositional Logic. In: Automated Reasoning and Its Applications. MIT Press, Cambridge (1997)