Using the breakout algorithm to identify hard and unsolvable subproblems

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

Volumn 2833, Issue , 2003, Pages 822-826

  Eisenberg, Carlos ^a   Faltings, Boi ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING; CONSTRAINT THEORY; LEARNING ALGORITHMS; LOCAL SEARCH (OPTIMIZATION);

LOCAL SEARCH; LOCAL SEARCH ALGORITHM; OVER-CONSTRAINED PROBLEM; SUB-PROBLEMS; VARIABLE ORDER;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 33845978306     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45193-8_60     Document Type: Article

References (5)

1. A. Davenport and E. P. K.Tsang. An empirical investigation into the exceptionally hard problems. Technical Report CSM-239, Department of Computer Science, University of Essex, U.K., 1995.
2. C. Eisenberg and B. Faltings. Using the Breakout Algorithm to Identify Hard and Unsolvable Subproblems. Technical Report IC-2003-46,Swiss Federal Institute of Technology (EPFL), Switzerland, 2003. http://ic2.epfl.ch/ publications/documents/IC_TECH_REPORT_200346.pdf
3. B. Faltings and S. Macho-Gonzalez. Open Constraint Satisfaction. Proc. of the 8th International Conference on Principles and Practice of Constraints Programming, 2002.
4. S. Minton, M. Johnston, A. Philips and P. Laird. Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems. Artificial Intelligence, Vol. 58, P. 161-205, 1992.
5. P. Morris. The breakout method for escaping from local minima. Proc. of the 11th National Conf. on Artificial Intelligence (Washington, DC), 1993, pp. 40-45.