On the sum constraint: Relaxation and applications

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Scopus citations

Abstract

The global constraint sum can be used as a tool to implement summations over sets of variables whose indices are not known in advance. This paper has two major contributions. On the theoretical side,we present the convex hull relaxation for the sum constraint in terms of linear inequalities, whose importance in the context of hybrid models is then justified. On the practical side, we demonstrate the applicability of the sum constraint in a scheduling problem that arises as part of the development of new products in the pharmaceutical and agrochemical industries. This problem can be modeled in two alternative ways: by using the sum constraint in a natural and straight forward manner, or by using the element constraint in a trickier fashion. With the convex hull relaxation developed earlier, we prove that the linear relaxation obtained from the former model is tighter than the one obtained from the latter.Moreover, our computational experiments indicate that the CP modelbased on the sum constraint is significantly more efficient as well.

Original languageEnglish (US)
Title of host publicationPrinciples and Practice of Constraint Programming- CP 2002 - 8th International Conference, CP 2002, Proceedings
EditorsPascal Van Hentenryck
PublisherSpringer Verlag
Pages80-92
Number of pages13
ISBN (Print)3540441204, 9783540441205
DOIs
StatePublished - 2002
Event8th International Conference on Principles and Practice of Constraint Programming, CP 2002 - Ithaca, United States
Duration: Sep 9 2002Sep 13 2002

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2470
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other8th International Conference on Principles and Practice of Constraint Programming, CP 2002
CountryUnited States
CityIthaca
Period9/9/029/13/02

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'On the sum constraint: Relaxation and applications'. Together they form a unique fingerprint.

  • Cite this

    Yunes, T. H. (2002). On the sum constraint: Relaxation and applications. In P. Van Hentenryck (Ed.), Principles and Practice of Constraint Programming- CP 2002 - 8th International Conference, CP 2002, Proceedings (pp. 80-92). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2470). Springer Verlag. https://doi.org/10.1007/3-540-46135-3_6