Date of Original Version

2002

Type

Book Chapter

Abstract or Description

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.

DOI

10.1007/3-540-46135-3_46

Share

COinS
 

Published In

Principles and Practice of Constraint Programming CP2002, LNCS 2470, 686-690.