Abstract
In this paper we address Max-CSP, a constraint optimization problem typically solved using a branch and bound scheme. It is well known that the efficiency of branch and bound greatly depends on the quality of the available lower bound. Previous approaches aggregate to the lower bound individual contributions of unassigned variables. In this paper, we augment this approach by adding global contributions of disjoint subsets of unassigned variables, which requires a partition of the set of unassigned variables. Using this idea, we introduce the partition-based lower bound. It improves previous approaches based on individual contributions in the sense that our method can be added up to previous bounds, possibly increasing their value. We demonstrate our method presenting two new algorithms, PFC-PRDAC and PFC-MPRDAC, which are the natural successors of PFC-RDAC and PFC-MRDAC augmented with our approach. We provide experimental evidence for the superiority of the new algorithms on random problems and real instances of weighted over-constrained problems.
Similar content being viewed by others
References
Bistarelli, S., Montanari, U., & Rossi, F. (1997). Semiring-based constraint satisfaction and optimization. Journal of the ACM 44(2): 201–236.
Cabon, B., de Givry, S., Lobjois, L., Schiex, T., & Warners, J. (1999). Radio link frequency assignment. Constraints; An International Journal 4: 79–89.
Freuder, E., & Wallace, R. (1992). Partial constraint satisfaction. Artificial Intelligence 58: 21–70.
Larrosa, J., & Meseguer, P. (1996). Exploiting the use of DAC in Max-CSP. In Proceedings of the 2th CP, Boston, pages 308–322. LNCS 11B, Berlin: Springer-Verlag.
Larrosa, J., Meseguer, P., & Schiex, T. (1999). Maintaining reversible DAC for Max-CSP. Artificial Intelligence 107(1): 149–163.
Schiex, T. (1998). Maximizing the reversible DAC lower bound in Max-CSP is NP-hard. Technical Report 1998/02, INRA.
Schiex, T., Fargier, H., & Verfaillie, G. (1995). Valued constraint satisfaction problems: hard and easy problems. In Proceedings of the 14th IJCAI, Montréal, Canada, pages 631–637.
Smith, B. (1994). Phase transition and the mushy region in constraint satisfaction. In Proceedings of the 11th European Conference on Artificial Intelligence, pages 100–104.
Verfaillie, G., Lemaître, M., & Schiex, T. (1996). Russian doll search. In Proceedings of the 13th AAAI, Portland, OR, pages 181–187.
Wallace, R. (1995). Directed arc consistency preprocessing. In Meyer, M. ed., Selected papers from the ECAI-94 Workshop on Constraint Processing, pages 121–137. LNCS 923, Berlin: Springer-Verlag.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Larrosa, J., Meseguer, P. Partition-Based Lower Bound for Max-CSP. Constraints 7, 407–419 (2002). https://doi.org/10.1023/A:1020510611031
Issue Date:
DOI: https://doi.org/10.1023/A:1020510611031