On the sum constraint

Relaxation and applications

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

8 Citations (Scopus)

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
StatePublished - Jan 1 2002
Externally publishedYes
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

Fingerprint

Drug products
Convex Hull
Scheduling
Linear Relaxation
Global Constraints
Pharmaceuticals
Hybrid Model
Industry
Computational Experiments
Summation
Experiments
Straight
Scheduling Problem
Linear Inequalities
Alternatives
Demonstrate
Model
Context

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Yunes, T. (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.

On the sum constraint : Relaxation and applications. / Yunes, Tallys.

Principles and Practice of Constraint Programming- CP 2002 - 8th International Conference, CP 2002, Proceedings. ed. / Pascal Van Hentenryck. Springer Verlag, 2002. p. 80-92 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2470).

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

Yunes, T 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. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2470, Springer Verlag, pp. 80-92, 8th International Conference on Principles and Practice of Constraint Programming, CP 2002, Ithaca, United States, 9/9/02.
Yunes T. On the sum constraint: Relaxation and applications. In Van Hentenryck P, editor, Principles and Practice of Constraint Programming- CP 2002 - 8th International Conference, CP 2002, Proceedings. Springer Verlag. 2002. p. 80-92. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Yunes, Tallys. / On the sum constraint : Relaxation and applications. Principles and Practice of Constraint Programming- CP 2002 - 8th International Conference, CP 2002, Proceedings. editor / Pascal Van Hentenryck. Springer Verlag, 2002. pp. 80-92 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{c28d1b61c88346e48e8c2fa7a0b691cd,
title = "On the sum constraint: Relaxation and applications",
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.",
author = "Tallys Yunes",
year = "2002",
month = "1",
day = "1",
language = "English (US)",
isbn = "3540441204",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "80--92",
editor = "{Van Hentenryck}, Pascal",
booktitle = "Principles and Practice of Constraint Programming- CP 2002 - 8th International Conference, CP 2002, Proceedings",
address = "Germany",

}

TY - GEN

T1 - On the sum constraint

T2 - Relaxation and applications

AU - Yunes, Tallys

PY - 2002/1/1

Y1 - 2002/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84957026851&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84957026851&partnerID=8YFLogxK

M3 - Conference contribution

SN - 3540441204

SN - 9783540441205

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 80

EP - 92

BT - Principles and Practice of Constraint Programming- CP 2002 - 8th International Conference, CP 2002, Proceedings

A2 - Van Hentenryck, Pascal

PB - Springer Verlag

ER -