Search

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. [ABSTRACT FROM AUTHOR]

Constraint programming (CP) is a young but rapidly developing technology that supports the modeling and solution of a wide range of planning, scheduling, search, and optimization problems. The integration of CP concepts into languages from other paradigms yields constraint-based multiparadigm programming. This article briefly introduces the constraint-based paradigm and discusses methods, problems, gains, and experiences in integrating CP techniques into the object-oriented paradigm, using Java as an example. [ABSTRACT FROM PUBLISHER]

The article presents a perspective on the ISI Impact Factor of the journal "Journal of Computing." It informs that journal has achieved an over 1.5 which ranks third among the 56 "OR/MS" journals, second among the 6 INFORMS journals. It announces that the former "Logic, Optimization, and Constraint Programming" area of the journal has been altered by area editor John N. Hooker Jr.