Abstract. The effects of combining search and modelling techniques can be complex and unpredictable, so guidelines are very important for the design and development of effective and robust solvers and models. A recently observed phenomenon is the negative effect of symmetry breaking constraints on local search performance. The reasons for this are poorly understood, and we attempt to shed light on the phenomenon by testing three conjectures: that the constraints create deep new local optima; that they can reduce the relative size of the basins of attraction of global optima; and that complex local search heuristics reduce their negative effects.
Local Search is a simple and effective approach for solving complex constrained combinatorial proble...
Traditional global search heuristics to solve constraint satisfaction problems focus on properties o...
Symmetry breaking has been shown to be an important method to speed up the search in constraint sa...
The effects of combining search and modelling techniques can be complex and unpredictable, so guidel...
Symmetry-breaking has been proved to be very effective when combined with complete solvers. Converse...
The effects of combining search and modelling techniques can be complex and unpredictable, so guidel...
The presence of symmetry in constraint satisfaction problems can cause a great deal of wasted search...
This paper argues that the performance of evolutionary algorithms working on hard optimisation probl...
Typically local search methods for solving constraint satis-faction problems such as GSAT, WalkSAT a...
The gap in automation between MIP/SAT solvers and those for constraint programming and constraint-ba...
Several local search algorithms for propositional satisability have been pro-posed which can solve h...
Typically local search methods for solving constraint satisfaction problems such as GSAT, WalkSAT, D...
The usual approaches of using local search can hardly be generalized. The advance in efficiency is t...
In this paper we deal with the use of local searches within global optimization algorithms. We discu...
Zhu, Zichen.Thesis Ph.D. Chinese University of Hong Kong 2016.Includes bibliographical references (l...
Local Search is a simple and effective approach for solving complex constrained combinatorial proble...
Traditional global search heuristics to solve constraint satisfaction problems focus on properties o...
Symmetry breaking has been shown to be an important method to speed up the search in constraint sa...
The effects of combining search and modelling techniques can be complex and unpredictable, so guidel...
Symmetry-breaking has been proved to be very effective when combined with complete solvers. Converse...
The effects of combining search and modelling techniques can be complex and unpredictable, so guidel...
The presence of symmetry in constraint satisfaction problems can cause a great deal of wasted search...
This paper argues that the performance of evolutionary algorithms working on hard optimisation probl...
Typically local search methods for solving constraint satis-faction problems such as GSAT, WalkSAT a...
The gap in automation between MIP/SAT solvers and those for constraint programming and constraint-ba...
Several local search algorithms for propositional satisability have been pro-posed which can solve h...
Typically local search methods for solving constraint satisfaction problems such as GSAT, WalkSAT, D...
The usual approaches of using local search can hardly be generalized. The advance in efficiency is t...
In this paper we deal with the use of local searches within global optimization algorithms. We discu...
Zhu, Zichen.Thesis Ph.D. Chinese University of Hong Kong 2016.Includes bibliographical references (l...
Local Search is a simple and effective approach for solving complex constrained combinatorial proble...
Traditional global search heuristics to solve constraint satisfaction problems focus on properties o...
Symmetry breaking has been shown to be an important method to speed up the search in constraint sa...