Noise strategies for improving local search
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
A fast taboo search algorithm for the job shop problem
Management Science
On the run-time behaviour of stochastic local search algorithms for SAT
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Dynamics of complex systems
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Metaheuristics in combinatorial optimization: Overview and conceptual comparison
ACM Computing Surveys (CSUR)
Applying interchangeability techniques to the distributed breakout algorithm
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
The exponentiated subgradient algorithm for heuristic Boolean programming
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Paper: Robust taboo search for the quadratic assignment problem
Parallel Computing
A new method for solving hard satisfiability problems
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
The breakout method for escaping from local minima
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
Evidence for invariants in local search
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
UBCSAT: an implementation and experimentation environment for SLS algorithms for SAT and MAX-SAT
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Automated reformulation of specifications by safe delay of constraints
Artificial Intelligence
Generalised graph colouring by a hybrid of local search and constraint programming
Discrete Applied Mathematics
Hybrid Local Search for Constrained Financial Portfolio Selection Problems
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Automated reformulation of specifications by safe delay of constraints
Artificial Intelligence
Variable dependency in local search: prevention Is better than cure
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
SLS'07 Proceedings of the 2007 international conference on Engineering stochastic local search algorithms: designing, implementing and analyzing effective heuristics
On the impact of small-world on local search
AI*IA'05 Proceedings of the 9th conference on Advances in Artificial Intelligence
SAT as an effective solving technology for constraint problems
ISMIS'06 Proceedings of the 16th international conference on Foundations of Intelligent Systems
Dynamic symmetry breaking restarted
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Scheduling social golfers with memetic evolutionary programming
HM'06 Proceedings of the Third international conference on Hybrid Metaheuristics
| Hi-index | 0.00 |
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.