Constraint satisfaction methods for generating valid cuts
Advances in computational and stochastic optimization, logic programming, and heuristic search
Mixed logical-linear programming
Discrete Applied Mathematics - Special issue on the satisfiability problem and Boolean functions
Tight Cooperation and Its Application in Piecewise Linear Optimization
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Branch and Infer: a Unifying Framework for Integer and Finite Domain Constraint Programming
INFORMS Journal on Computing
Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
INFORMS Journal on Computing
Representations of the all_different Predicate of Constraint Satisfaction in Integer Programming
INFORMS Journal on Computing
Logic, Optimization, and Constraint Programming
INFORMS Journal on Computing
Integrated Methods for Optimization
Integrated Methods for Optimization
Propagating the bin packing constraint using linear programming
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
| Hi-index | 0.00 |
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.