Constraint Programming (CP) is a field of mathematical programming which focuses on finding feasible solutions subject to some given constraints. Theoretically, it is as hard as mixed …

Aug 6, 2017 · A constraint programming engine proves optimality by showing that no better solution than the current one can be found, while an mathematical programming engine uses a …

Integer programming (IP) has been around for a long time and therefore a lot of literature deals with IP techniques and models. Constraint Programming is conceptually also old (I think), but …

Constraint programming problems have all the advantages and disadvantages (such as non-convexity) of mixed-integer programming problems, and the extra requirements such as …

Jul 26, 2020 · MIP models tend to have a standard set of "features": linear (or maybe convex quadratic) constraints; linear (or maybe quadratic) objective functions; and of course variables …

The integrality constraints allow MIP models to capture the discrete nature of some decisions. For example, a variable whose values are restricted to 0 or 1, called a binary variable, can be used …

Dec 1, 2015 · In this paper, we introduced two models, using mixed-integer linear programming and constraint programming respectively, to solve the daily surgical case scheduling problem …

This article introduces constraint integer programming (CIP), which is a novel way to combine constraint programming (CP) and mixed integer programming (MIP) methodologies. CIP is a …

Mar 1, 2015 · In this work, each model is individually analyzed and then compared considering: i) Optimization success performance, ii) Computational processing time, iii) Greatest Resource …

Mar 22, 2023 · We present MIP and CP models for each variant of these problems and evaluate their performance over 17 relevant and standard benchmarks that we identified in the literature.