Dynamic Lex Constraints

Symmetries are one of the difficulties constraint programming users have to deal with. One way to get rid of symmetries is to add lex constraints. However, it can adversely affect the efficiency of a tree search method if the lex constraints remove the solution that would have been found at the firs...

Full description

Saved in:
Bibliographic Details
Published inLecture notes in computer science pp. 453 - 467
Main Author Puget, Jean-François
Format Book Chapter Conference Proceeding
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2006
Springer
SeriesLecture Notes in Computer Science
Subjects
Applied sciences
Exact sciences and technology
Mathematical programming
Operational research and scientific management
Operational research. Management science
Filtering
Filter
Ordering
Constraint satisfaction
Node method
Search tree
Constrained optimization
Mathematical programming
Symmetry
Online AccessGet full text

Cover

More Information
Summary:Symmetries are one of the difficulties constraint programming users have to deal with. One way to get rid of symmetries is to add lex constraints. However, it can adversely affect the efficiency of a tree search method if the lex constraints remove the solution that would have been found at the first place. We propose to use an alternative filtering algorithm which does not exclude the first solution. We present both a theoretical analysis and some experimental evidence that it is as efficient as lex constraints. We also show that its efficiency does not depend much on the variable ordering used in the tree search. Last, we show that it can prune more nodes than the SBDS method.
ISBN:3540462678
9783540462675
ISSN:0302-9743
1611-3349
DOI:10.1007/11889205_33