Constraint satisfaction in logic programming
Constraint satisfaction in logic programming
Constraint satisfaction using constraint logic programming
Artificial Intelligence - Special volume on constraint-based reasoning
A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Mixed logical-linear programming
Discrete Applied Mathematics - Special issue on the satisfiability problem and Boolean functions
A Generic Model and Hybrid Algorithm for Hoist Scheduling Problems
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Tight Cooperation and Its Application in Piecewise Linear Optimization
CP '99 Proceedings of the 5th 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
A scheme for unifying optimization and constraint satisfaction methods
The Knowledge Engineering Review
The Expressive Power of Binary Linear Programming
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Network Flow Problems in Constraint Programming
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
PADL'07 Proceedings of the 9th international conference on Practical Aspects of Declarative Languages
A high level language for solver independent model manipulation and generation of hybrid solvers
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Proceedings of the 5th ACM/SPEC international conference on Performance engineering
| Hi-index | 0.00 |
Constraint programming offers a variety of modeling objects such as logical and global constraints, that lead to concise and clear models for expressing combinatorial optimization problems. We propose a way to provide a linear formulation of such a model and detail, in particular, the transformation of some global constraints. An automatic procedure for producing and updating formulations has been implemented and we illustrate it on combinatorial optimization problems.