Published May 23, 2011
| Version v1
Conference paper
The Objective Sum Constraint.
- Creators
- Régin, Jean-Charles
- Petit, Thierry
- Others:
- Université Nice Sophia Antipolis (1965 - 2019) (UNS) ; COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)
- Laboratoire d'Informatique de Nantes Atlantique (LINA) ; Mines Nantes (Mines Nantes)-Université de Nantes (UN)-Centre National de la Recherche Scientifique (CNRS)
- Theory, Algorithms and Systems for Constraints (TASC) ; Laboratoire d'Informatique de Nantes Atlantique (LINA) ; Mines Nantes (Mines Nantes)-Université de Nantes (UN)-Centre National de la Recherche Scientifique (CNRS)-Mines Nantes (Mines Nantes)-Université de Nantes (UN)-Centre National de la Recherche Scientifique (CNRS)-Département informatique - EMN ; Mines Nantes (Mines Nantes)-Inria Rennes – Bretagne Atlantique ; Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)
Description
Constraint toolkits generally propose a sum constraint where a global objective variable should be equal to a sum of local objective variables, on which bound-consistency is achieved. To solve optimization problems this propagation is poor. Therefore, ad-hoc techniques are designed for pruning the global objective variable by taking account of the interactions between constraints defined on local objective variables. Each technique is specific to each (class of) practical problem. In this paper, we propose a new global constraint which deals with this issue in a generic way. We propose a sum constraint which exploits the propagation of a set of constraints defined on local objective variables.
Abstract
International audience
Additional details
- URL
- https://hal.archives-ouvertes.fr/hal-00648108
- URN
- urn:oai:HAL:hal-00648108v1
- Origin repository
- UNICA