Maintaining Reversible DAC for Max-CSP

@article{Larrosa1999MaintainingRD,
  title={Maintaining Reversible DAC for Max-CSP},
  author={Javier Larrosa and Pedro Meseguer and Thomas Schiex},
  journal={Artif. Intell.},
  year={1999},
  volume={107},
  pages={149-163}
}
We introduce an exact algorithm for maximizing the number of satisfied constraints in an overconstrained CSP (Max-CSP). The algorithm, which can also solve weighted CSP, probabilistic CSP and other similar problems, is based on directed arc-inconsistency counts (DAC). The usage of DAC increases the lower bound of branch and bound based algorithms for Max-CSP, improving their efficiency. Originally, DAC were defined following a static variable ordering. In this paper, we relax this condition… CONTINUE READING
Highly Influential
This paper has highly influenced 11 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 110 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 72 extracted citations

Conflict Directed Backjumping for Max-CSPs

IJCAI • 2007
View 10 Excerpts
Highly Influenced

Adding Flexibility to Russian Doll Search

2008 20th IEEE International Conference on Tools with Artificial Intelligence • 2008
View 7 Excerpts
Highly Influenced

Combining VNS with constraint programming for solving anytime optimization problems

European Journal of Operational Research • 2008
View 5 Excerpts
Highly Influenced

111 Citations

01020'99'03'08'13'18
Citations per Year
Semantic Scholar estimates that this publication has 111 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Algorithmes d’optimisation sous contraintes Ctudies darts un cadre temps-reel

S. de Givry
Ph.D. Thesis, CERTIONERA-SupACro, • 1988
View 4 Excerpts
Highly Influenced

Network-Based Heuristics for Constraint-Satisfaction Problems

Artif. Intell. • 1987
View 3 Excerpts
Highly Influenced

Maximizing the reversible DAC lower bound in Max-CSP is NP-hard

J T. Schiex
Technical Report 1998/02, • 1998

Similar Papers

Loading similar papers…