Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Cabon, B., de Givry, S., Lobjois, L., Schiex, T., Warners, J.P.: Radio Link Frequency Assignment. Constraints 4(1), 79–89 (1999)
Cooper, M., de Givry, S., Schiex, T.: Optimal soft arc consistency. In: IJCAI, pp. 68–73 (2007)
de Givry, S., Heras, F., Larrosa, J., Rollon, T., Schiex, T.: The SoftCSP and Max-SAT benchmarks and algorithm web site (2006), http://carlit.toulouse.inra.fr/cgi-bin/awki.cgi/softcsp
de Givry, S., Zytnicki, M., Larrosa, J.: Existential arc consistency: Getting closer to full arc consistency in weighted CSPs. In: IJCAI, pp. 84–89 (2005)
Khemmoudj, M.O.I., Bennaceur, H.: Clique Inference Process for Solving Max-CSP. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 746–750. Springer, Heidelberg (2006)
Khemmoudj, M.O.I., Bennaceur, H.: Clique Based Lower Bounds for Max-CSP. Technical report 2006-02, LIPN (2006)
Koster, A.: Frequency Assignment: Models and Algorithms. PhD Thesis. UM (Maastricht, The Netherlands) (1999)
Larrosa, J., Schiex, T.: In the quest of the best form of local consistency for Weighted CSP. In: IJCAI, pp. 239–244 (2003)
Schiex, T.: Arc Consistency for Soft Constraints. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, pp. 411–424. Springer, Heidelberg (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Khemmoudj, M.O.I., Bennaceur, H. (2007). Valid Inequality Based Lower Bounds for WCSP. In: Bessière, C. (eds) Principles and Practice of Constraint Programming – CP 2007. CP 2007. Lecture Notes in Computer Science, vol 4741. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74970-7_29
Download citation
DOI: https://doi.org/10.1007/978-3-540-74970-7_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74969-1
Online ISBN: 978-3-540-74970-7
eBook Packages: Computer ScienceComputer Science (R0)