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
La programmation par contraintes est une approche régulièrement utilisée pour traiter des problèmes ...
In this thesis we study constraint relaxations of various nonlinear programming (NLP) al-gorithms in...
Abstract. This paper investigates cumulative scheduling in uncertain environ-ments, using constraint...
This work falls in the scope of constraint-based scheduling. In this framework, the most frequently ...
International audienceThis paper concerns project scheduling under resource constraints. The objecti...
In this chapter, we present the integration of various forms of problem relaxation in Constraint Pr...
Constraint programming is an interesting approach to solve scheduling problems. In cumulative schedu...
A discrete problem can be relaxed by taking the continuous relaxation of an integer programming form...
This article first introduces an extension of the classical cumulative constraint: each task is no m...
Abstract: Constraint programming (CP) offers flexible and effective tools for modeling combinatorial...
This thesis deals with the integration of Constraint and Linear Programming techniques for solving c...
Global constraints play a crucial role in solving real-life combinatorial problems thanks to encapsu...
In constraint programming [JM94, Wal96, FA97, MS98], combinatorial problems are specified declarativ...
This paper introduces two MILP models for the cumulative scheduling constraint and associated pre-pr...
This paper presents a set of satisfiability tests and timebound adjustmentalgorithms that can be app...
La programmation par contraintes est une approche régulièrement utilisée pour traiter des problèmes ...
In this thesis we study constraint relaxations of various nonlinear programming (NLP) al-gorithms in...
Abstract. This paper investigates cumulative scheduling in uncertain environ-ments, using constraint...
This work falls in the scope of constraint-based scheduling. In this framework, the most frequently ...
International audienceThis paper concerns project scheduling under resource constraints. The objecti...
In this chapter, we present the integration of various forms of problem relaxation in Constraint Pr...
Constraint programming is an interesting approach to solve scheduling problems. In cumulative schedu...
A discrete problem can be relaxed by taking the continuous relaxation of an integer programming form...
This article first introduces an extension of the classical cumulative constraint: each task is no m...
Abstract: Constraint programming (CP) offers flexible and effective tools for modeling combinatorial...
This thesis deals with the integration of Constraint and Linear Programming techniques for solving c...
Global constraints play a crucial role in solving real-life combinatorial problems thanks to encapsu...
In constraint programming [JM94, Wal96, FA97, MS98], combinatorial problems are specified declarativ...
This paper introduces two MILP models for the cumulative scheduling constraint and associated pre-pr...
This paper presents a set of satisfiability tests and timebound adjustmentalgorithms that can be app...
La programmation par contraintes est une approche régulièrement utilisée pour traiter des problèmes ...
In this thesis we study constraint relaxations of various nonlinear programming (NLP) al-gorithms in...
Abstract. This paper investigates cumulative scheduling in uncertain environ-ments, using constraint...
DOI
Add to ORKG