A new polynomial-time algorithm for linear programming
Combinatorica
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Integer and combinatorial optimization
Integer and combinatorial optimization
Constraint satisfaction in logic programming
Constraint satisfaction in logic programming
A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
A fast algorithm for the bound consistency of alldiff constraints
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
The OPL optimization programming language
The OPL optimization programming language
Solving TSP with time windows with constraints
Proceedings of the 1999 international conference on Logic programming
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Arc Consistency for Global Cardinality Constraints with Costs
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
On the intersection of AI and OR
The Knowledge Engineering Review
| Hi-index | 0.00 |
Maths programming (MP) and constraint programming (CP) are two techniques that are able to solve difficult industrial optimisation problems. The purpose of this paper is to compare them from an algorithmic and a modelling point of view. Algorithmic principles of each approach are described and contrasted. Some ways of combining both techniques are also introduced.