In this paper we give an overview of the current state of the graphical features provided by ILOG OPL Studio for debugging and performance tuning of OPL programs or external ILOG Solver based applications. This paper focuses on combining propagation and search information using the Search Tree view

Error! Bookmark not defined. This paper describes the design and development of a staff scheduling software product called the Expert Rotation Generator (ERG). ERG’s scheduling engine uses ILOG’s Solver library to create staff rotations that satisfy a variety of staffing constraints in a reasonable

Abstract. The constraint functional logic programming system T OY has been using the SICStus Prolog finite domain (FD) constraint solver. In this work, we show how to integrate the ILOG CP FD constraint solv-ing technology into this system, with the aim of improving its application domain

-making modules (without needs for modification of the existing code). The following paper presents ILOG SCHEDULE, a C++ library enabling the representation of a wide collection of scheduling constraints in terms of "resources" and "activities." ILOG SCHEDULE is based on SOLVER, the generic

Wehave implemented a C++ library, called ILOG SOLVER, that embodies Constraint Logic Programming #CLP# concepts such as logical variables, incremental constraint satisfaction and backtracking. This library combines Object Oriented Programming #OOP# with CLP. This has two advantages. First of all

duplication. The mathematical model is coded in CPLEX Optimisation Programming Language (OPL), a mathematical programming language of IBM ILOG CPLEX optimization studio and illustrated with a literature problem. The CPLEX solver provides optimal solution to the CF problem in a reasonable computational time.

an externally supplied variable ordering and causing space blowups in certain applications. In a parallel development, SAT-solving procedures, such as Stalmarck's method or the DavisPutnam procedure, have been used successfully in verifying very large industrial systems. These efforts have recently

candidates. This problem can be stated as a Valued Constraint Satisfaction Problem, a general framework for which our team has developed a powerful set of algorithms. This paper reports an experiment the aim of which was (1) to evaluate the ease with which this problem can be expressed with ILOG Solver

Current problem solving systems are constrained in their applicability by inadequate world models. We suggest a world model based on a temporal logic. This approach allows the problem solver to gather constraints on the ordering of actions without having to commit to an ordering when a conflict

The availability of effective exact or heuristic solution methods for general Mixed-Integer Programs (MIPs) is of paramount importance for practical ap-plications. In the present paper we investigate the use of a generic MIP solver as a black-box “tactical ” tool to explore effectively suitable