A relaxation of the cumulative constraint

John N. Hooker, Hong Yan

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

10 Citations (Scopus)

Abstract

Hybrid methods that combine constraint programming with mathematical programming make essential use of continuous relaxations for global constraints. We state a relaxation for the cumulative constraint. In particular we identify facet-defining inequalities for problems in which some jobs have the same duration, release time, and resource consumption rate. We also identify a much larger class of valid inequalities that exist in all problems.
Original languageEnglish
Title of host publicationPrinciples and Practice of Constraint Programming- CP 2002 - 8th International Conference, CP 2002, Proceedings
PublisherSpringer Verlag
Pages686-691
Number of pages6
ISBN (Print)3540441204, 9783540441205
Publication statusPublished - 1 Jan 2002
Event8th International Conference on Principles and Practice of Constraint Programming, CP 2002 - Ithaca, United States
Duration: 9 Sep 200213 Sep 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

Conference

Conference8th International Conference on Principles and Practice of Constraint Programming, CP 2002
CountryUnited States
CityIthaca
Period9/09/0213/09/02

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this