The Relation Between Complete and Incomplete Search

[1]  Bart Selman,et al.  Systematic Versus Stochastic Constraint Satisfaction , 1995, IJCAI.

[2]  Michela Milano,et al.  Global Cut Framework for Removing Symmetries , 2001, CP.

[3]  David Joslin,et al.  "Squeaky Wheel" Optimization , 1998, AAAI/IAAI.

[4]  Bart Selman,et al.  Finding Small Unsatisfiable Cores to Prove Unsatisfiability of QBFs , 2006, ISAIM.

[5]  Meinolf Sellmann,et al.  Symmetry Breaking , 2001, CP.

[6]  Andrew B. Baker,et al.  The Hazards of Fancy Backtracking , 1994, AAAI.

[7]  Toby Walsh,et al.  Local Search and the Number of Solutions , 1996, CP.

[8]  Bart Selman,et al.  Accelerating Random Walks , 2002, CP.

[9]  Emmanuel Zarpas.  Back to the SAT05 Competition: an a Posteriori Analysis of Solver Performance on Industrial Benchmarks , 2006, J. Satisf. Boolean Model. Comput..

[10]  Ralph R. Martin,et al.  Reducing Epistasis in Combinatorial Problems by Expansive Coding , 1993, ICGA.

[11]  Ian P. Gent,et al.  Symmetry Breaking in Constraint Programming , 2000, ECAI.

[12]  Weixiong Zhang,et al.  Depth-First Branch-and-Bound versus Local Search: A Case Study , 2000, AAAI/IAAI.

[13]  Paul Walton Purdom,et al.  Backtrack Searching in the Presence of Symmetry , 1988, Nord. J. Comput..

[14]  W. D. Harvey,et al.  Nonsystematic backtracking search , 1995 .

[15]  Hantao Zhang,et al.  Combining Local Search and Backtracking Techniques for Constraint Satisfaction , 1996, AAAI/IAAI, Vol. 1.

[16]  David Joslin,et al.  Exploiting Symmetry in Lifted CSPs , 1997, AAAI/IAAI.

[17]  Steven David Prestwich.  Negative Effects of Modeling Techniques on Search Performance , 2003, Ann. Oper. Res..

[18]  J. F. Benders.  Partitioning procedures for solving mixed-variables programming problems , 1962 .

[19]  Steven Minton,et al.  Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems , 1992, Artif. Intell..

[20]  Inês Lynce,et al.  Local Search for Unsatisfiability , 2006, SAT.

[21]  Steven David Prestwich.  A Hybrid Search Architecture Applied to Hard Random 3-SAT and Low-Autocorrelation Binary Sequences , 2000, CP.

[22]  Chris N. Potts,et al.  Dynasearch - interative local improvement by dynamic programming: Part I, The traveling salesman problem , 1995 .

[23]  Steven David Prestwich,et al.  SAT problems with chains of dependent variables , 2003, Discret. Appl. Math..

[24]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[25]  Mark K. Goldberg,et al.  Constructing cliques using restricted backtracking , 1993, Cliques, Coloring, and Satisfiability.

[26]  Justin Pearson,et al.  1st International Workshop on Local Search Techniques in Constraint Satisfaction , 2004 .

[27]  Rolf Backofen,et al.  Excluding Symmetries in Constraint-Based Search , 1999, CP.

[28]  James M. Crawford,et al.  Symmetry-Breaking Predicates for Search Problems , 1996, KR.

[29]  Michel Gendreau,et al.  A View of Local Search in Constraint Programming , 1996, CP.

[30]  Andreas T. Ernst,et al.  Integrating ACO and Constraint Propagation , 2004, ANTS Workshop.

[31]  Henry Kautz,et al.  Exploiting Variable Dependency in Local Search , 1997, IJCAI 1997.

[32]  Jean-François Puget,et al.  On the Satisfiability of Symmetrical Constrained Satisfaction Problems , 1993, ISMIS.

[33]  Thomas Stützle,et al.  Stochastic Local Search: Foundations & Applications , 2004 .

[34]  Hector J. Levesque,et al.  A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.

[35]  Holger H. Hoos,et al.  Using Stochastic Local Search to Solve Quantified Boolean Formulae , 2003, CP.

[36]  Karl Ernst Osthaus.  Van de Velde , 1920 .

[37]  Adam Prügel-Bennett,et al.  Symmetry breaking in population-based optimization , 2004, IEEE Transactions on Evolutionary Computation.

[38]  Carlos Ansótegui,et al.  Disco - Novo - GoGo: Integrating Local Search and Complete Search with Restarts , 2006, AAAI.

[39]  Jin-Kao Hao,et al.  GASAT: A Genetic Local Search Algorithm for the Satisfiability Problem , 2006, Evolutionary Computation.

[40]  Rina Dechter,et al.  GSAT and Local Consistency , 1995, IJCAI.

[41]  Narendra Jussien,et al.  Local search with constraint propagation and conflict-based heuristics , 2000, Artif. Intell..

[42]  Carme Torras,et al.  Exploiting symmetries within constraint satisfaction search , 2001, Artif. Intell..

[43]  Mark E. Stickel,et al.  Implementing the Davis–Putnam Method , 2000, Journal of Automated Reasoning.

[44]  Paul Shaw,et al.  Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.

[45]  Shu Lin,et al.  Applied Algebra, Algebraic Algorithms and Error-Correcting Codes , 1999, Lecture Notes in Computer Science.

[46]  Andrea Schaerf,et al.  Combining Local Search and Look-Ahead for Scheduling and Constraint Satisfaction Problems , 1997, IJCAI.

[47]  J. Christopher Beck.  Solution-Guided Multi-Point Constructive Search for Job Shop Scheduling , 2007, J. Artif. Intell. Res..

[48]  Jin-Kao Hao,et al.  Hybrid Evolutionary Algorithms for Graph Coloring , 1999, J. Comb. Optim..

[49]  David A. McAllester,et al.  GSAT and Dynamic Backtracking , 1994, KR.

[50]  Zbigniew Michalewicz,et al.  A Survey of Constraint Handling Techniques in Evolutionary Computation Methods , 1995 .

[51]  John N. Hooker,et al.  A Search-Infer-and-Relax Framework for Integrating Solution Methods , 2005, CPAIOR.

[52]  Gilles Audemard,et al.  GUNSAT: A Greedy Local Search Algorithm for Unsatisfiability , 2007, IJCAI.

[53]  Edward A. Hirsch,et al.  Solving Boolean Satisfiability Using Local Search Guided by Unit Clause Elimination , 2001, CP.

[54]  Nobuhiro Yugami,et al.  Improving Repair-Based Constraint Satisfaction Methods by Value Propagation , 1994, AAAI.

[55]  Andrea Roli,et al.  Symmetry Breaking and Local Search Spaces , 2005, CPAIOR.

[56]  P. Langley.  Systematic and nonsystematic search strategies , 1992 .

[57]  Makoto Yokoo,et al.  Weak-Commitment Search for Solving Constraint Satisfaction Problems , 1994, AAAI.

[58]  Barry Richards,et al.  Nonsystematic Search and No-Good Learning , 2000, Journal of Automated Reasoning.

[59]  Thomas Schiex,et al.  Solution Reuse in Dynamic Constraint Satisfaction Problems , 1994, AAAI.

[60]  Joao Marques-Silva,et al.  Using Randomization and Learning to Solve Hard Real-World Instances of Satisfiability , 2000, CP.

[61]  Matthew L. Ginsberg,et al.  Dynamic Backtracking , 1993, J. Artif. Intell. Res..

[62]  Bart Selman,et al.  Boosting Combinatorial Search Through Randomization , 1998, AAAI/IAAI.

[63]  Craig A. Morgenstern.  Distributed coloration neighborhood search , 1993, Cliques, Coloring, and Satisfiability.

[64]  Lakhdar Sais,et al.  Boosting Systematic Search by Weighting Constraints , 2004, ECAI.

[65]  Takashi Horiyama,et al.  Density condensation of Boolean formulas , 2003, Discret. Appl. Math..

[66]  S. Prestwich.  Local Search and Backtracking vs Non-Systematic Backtracking , 2001 .

[67]  Matthew L. Ginsberg,et al.  Limited Discrepancy Search , 1995, IJCAI.

[68]  Inês Lynce,et al.  Random backtracking in backtrack search algorithms for satisfiability , 2007, Discret. Appl. Math..

[69]  Wheeler Ruml,et al.  Complete Local Search for Propositional Satisfiability , 2004, AAAI.

[70]  David E. Goldberg,et al.  Genetic Algorithms, Clustering, and the Breaking of Symmetry , 2000, PPSN.