Radio Link Frequency Assignment
Constraints
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
In the quest of the best form of local consistency for weighted CSP
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Existential arc consistency: getting closer to full arc consistency in weighted CSPs
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Clique inference process for solving Max-CSP
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Solving weighted constraint satisfaction problems with memetic/exact hybrid algorithms
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
Most of efficient WCSP solving methods are based on arc consistency notion used to transform a WCSP into an equivalent one easier to solve. There are several forms of arc consistency : AC* [9], DAC* [8], FDAC* [8], EDAC* [4]. Recently, an Optimal Soft Arc Consistency (OSAC) was proposed [2]. But this technique requires much computing time since it is based on a large linear program. We propose in this work a new valid transformation based on modeling of the WCSP as a linear program easier to solve than the computing of OSAC. Preliminary experiments on random and structured problems are presented, showing the advantage of our technique.