https://hal-lirmm.ccsd.cnrs.fr/lirmm-00268450Petit, ThomasThomasPetitRégin, Jean-CharlesJean-CharlesRéginLIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier - UM - Université de Montpellier - CNRS - Centre National de la Recherche ScientifiqueBessière, ChristianChristianBessièreCOCONUT - Agents, Apprentissage, Contraintes - LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier - UM - Université de Montpellier - CNRS - Centre National de la Recherche ScientifiqueRange-Based Algorithm for Max-CSPHAL CCSD2002Constraint Satisfaction Problem[INFO] Computer Science [cs]Carvalho De Matos, Christine2019-09-04 20:00:002022-09-06 16:53:212019-09-04 20:01:54enConference papershttps://hal-lirmm.ccsd.cnrs.fr/lirmm-00268450/document10.1007/3-540-46135-3_19application/pdf1A Max-CSP consists of searching for a solution which minimizes the number of violated constraints. The best existing solving algorithm is PFC-MRDAC. It is based on the computation of a lower bound of the number of violations. To compute this lower bound it is required to evaluate the violations with respect to each value of each domain. Unfortunately, some applications imply thousands of variables with huge domains. In scheduling, it arises that numerous activities have to be scheduled over several months with a unit of time of a few minutes. In this situation using PFC-MRDAC requires a large amount of memory which can prevent from using it. In this paper, we propose an algorithm called the Range-based Max-CSP Algorithm (RMA), based on the exploitation of bound-based filtering algorithms of constraints. This technique does not require to study each value of each domain: its complexity depends only on the number of variables and the number of constraints. No assumption is made on the constraints except that their filtering algorithms are related to the bounds of the involved variables, the general case for scheduling constraints. Then, when the only information available for a variable x w.r.t. a constraint C are the new bounds of D(x) obtained by applying the filtering algorithm of C, the lower bounds of violations provided by PFC-MRDAC and RMA are identical.