Constraint programming

Conseil Europeen de E Industrie Chimique Contribution Margin I Contribution Margin II Constraint Programming... 

Constraint Programming (CP) is a further optimization approach where relations between variables are stated in form of constraints in order to better solve specifically hard bounded integer optimization problems such as production scheduling... 

All chapters are equipped with clear figures and tables to help the reader understand the included topics. Furthermore, several appendices are included to explain the general background in the area of stochastic programming, chance constraint programming and robust optimization. 

For the third example, our algorithm is compared to the results of the authors of [4] who solve the scheduling and sequencing problem by constraint programming (CP). It can be seen in Table 2 that it takes slightly more time to compute the heuristic ASAP solution than to find the first feasible solution by CP, but that the ASAP solution has a significantly smaller makespan. The EA improves the initial solution in less than half a minute to a solution which is very close to the optimum. 

Parametric programming Constraint programming Multi-scale computations... 

Heipcke S. 1999. An example of integrating constraint programming and mathematical programming, Electron. Notes Discrete Math., 1(1). 

Hooker J.N. 2002. Logic, optimization, and constraint programming, INFORMS J. Comput., 4(4), 295-321. 

Butler R, Williams FW. Optimum design using VICONOPT, a buckling and strength constraint program for prismatic assemblies of anisotropic plates. Comput Struct 1992 43(4) 699-708. 

The second category includes hybrids resulting from the combination of meta-heuristics with constraint programming, integer programming, tree-based search methods, data mining techniques, etc. [26]. 

Constraint programming has been successfully applied to problem areas as diverse as DNA structure analysis, time-tabling for hospitals, and industry scheduling. It is well adapted to solving real-life problems because many application domains evoke constraint description naturally. Some examples follow ... 

Bartak, R. (1999). Constraint Programming In Pursuit of the Holy Grail. In Proceedings of WDS99, Prague. ... 

Bockmayr, A. Kasper, T. (1998). Branch and infer A unifying framework for integer and finite domain constraint programming. INFORMS Journal of Computing, Vol. 10, No. 

Quiroga, O. Zeballos, L. Henning G.A. (2005). Constraint Programming approach to tool allocation and resource scheduling in FMS. In Proceedings of the 2005 IEEE International conference on Robotics and automation ICRA-2005, pp. 3715-3720. 

Weil, G. Heus K. Francois, P. Poujade, M. (1995). Constraint programming for nurse scheduling. IEEE Engineering in medicine and biology magazine, Vol. 14, No. 4, pp.417-422. 

Continuous constraint programming has been widely used to model safe reasoning in applications where uncertainty arises. A Continuous Constraint Satisfaction Problem (CCSP) (Lhomme 1993, Benhamou, McAllester, van Hentenryck 1994, Sam-Haroud Fallings 1996) is a triple X,D,C)... 

Solnon Ch. 2010 Ant Colony Optimization and Constraint Programming, ISTE Ltd and John Wiley and Sons, Inc. 

---