Tractable constraints on ordered domains
Artificial Intelligence
Radio Link Frequency Assignment
Constraints
New Lower Bounds of Constraint Violations for Over-Constrained Problems
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Discrete Applied Mathematics
Arc consistency for soft constraints
Artificial Intelligence
A new local consistency for weighted CSP dedicated to long domains
Proceedings of the 2006 ACM symposium on Applied computing
The complexity of soft constraint satisfaction
Artificial Intelligence
A Linear Programming Approach to Max-Sum Problem: A Review
IEEE Transactions on Pattern Analysis and Machine Intelligence
A maximal tractable class of soft constraints
Journal of Artificial Intelligence Research
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Valued constraint satisfaction problems: hard and easy problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Temporal constraint reasoning with preferences
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Existential arc consistency: getting closer to full arc consistency in weighted CSPs
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
MiniMaxSAT: a new weighted Max-SAT solver
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Exact solution of permuted submodular minsum problems
EMMCVPR'07 Proceedings of the 6th international conference on Energy minimization methods in computer vision and pattern recognition
Soft Constraints Processing over Divisible Residuated Lattices
ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Bounds arc consistency for weighted CSPs
Journal of Artificial Intelligence Research
Set branching in constraint optimization
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Solving nurse rostering problems using soft global constraints
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
A weighted CSP approach to cost-optimal planning
AI Communications
Expert Systems with Applications: An International Journal
Distributed constraint optimization problems related with soft arc consistency
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
WCSP integration of soft neighborhood substitutability
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Dynamic virtual arc consistency
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Modularity-based decompositions for valued CSP
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
Optimizing a combination of local cost functions on discrete variables is a central problem in many formalisms such as in probabilistic networks, maximum satisfiability, weighted CSP or factor graphs. Recent results have shown that maintaining a form of local consistency in a Branch and Bound search provides bounds that are strong enough to solve many practical instances. In this paper, we introduce Virtual Arc Consistency (VAC) which iteratively identifies and applies sequences of cost propagation over rational costs that are guaranteed to transform a WCSP in another WCSP with an improved constant cost. Although not as strong as Optimal Soft Arc Consistency, VAC is faster and powerful enough to solve submodular problems. Maintaining VAC inside branch and bound leads to important improvements in efficiency on large difficult problems and allowed us to close two famous frequency assignment problem instances.