Contraint-Based Combinators for Local Search
Constraints
A constraint programming approach to the multiple-venue, sport-scheduling problem
Computers and Operations Research
An Hybrid, QoS-Aware Discovery of Semantic Web Services Using Constraint Programming
ICSOC '07 Proceedings of the 5th international conference on Service-Oriented Computing
Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints
INFORMS Journal on Computing
Transparent Parallelization of Constraint Programming
INFORMS Journal on Computing
Tractable symmetry breaking for CSPs with interchangeable values
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
OSiL: An instance language for optimization
Computational Optimization and Applications
Dealing with fixable and non-fixable properties in service matchmaking
ICSOC/ServiceWave'09 Proceedings of the 2009 international conference on Service-oriented computing
Synthesis of search algorithms from high-level CP models
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
An approach to temporal-aware procurement of web services
ICSOC'05 Proceedings of the Third international conference on Service-Oriented Computing
Compositional derivation of symmetries for constraint satisfaction
SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation
The constraint of difference and total dual integrality
Proceedings of the 17th Panhellenic Conference on Informatics
| Hi-index | 0.00 |
In recent years, it has been increasingly recognized that constraint and integer programming have orthogonal and complementary strengths in stating and solving combinatorial optimization applications. In addition, their integration has become an active research topic. The optimization programming language OPL was a first attempt at integrating these technologies both at the language and at the solver levels. In particular, OPL is a modeling language integrating the rich language of constraint programming and the ability to specify search procedures at a high level of abstraction. Its implementation includes both constraint and mathematical programming solvers, as well as some cooperation schemes to make them collaborate on a given problem. The purpose of this paper is to illustrate, using OPL, the constraint-programming approach to combinatorial optimization and the complementary strengths of constraint and integer programming.