Object oriented programming aims at code lisibility and conciseness via abstract data type declarations and takes advantage from setting the objects (ie data) in the center of the application, instead of procedures or demonstrations. Just as in Logic programming, where describing the properties of the solution of some problem is (theoreticaly) enough to allow the program to compute the solution...

Benders decomposition [1] is a solving strategy based on the separation of the variables of the problem. It is often introduced as a basis for models and techniques using the complementary strengths of constraint programming and optimization techniques. Hybridization schemes have appeared recently and provided interesting computational results [4, 5, 7, 8]. They have been extended [2, 3, 6] to ...

Constraint Programs and Mixed Integer Programs are closely related optimization problems originating from different scientific areas. Today’s state-of-the-art algorithms of both fields have several strategies in common, in particular the branch-and-bound process to recursively divide the problem into smaller subproblems. On the other hand, the main techniques to process each subproblem are diff...

Among concurrent logic programming or CLP languages like Concurrent Prolog [16] two of the most prominent are GHC [21] and Parlog [6]. GHC and Parlog have similar execution models but complementary virtues as will be argued. Hence it could be desirable to find some common denominator of both languages, which is sufficiently expressive to be worth programming in its own right, and yet is suffici...

One of the most important applications of the Asymmetric Hamiltonian Path Problem is in scheduling. In this paper we describe a variant of this problem, and develop both a mathematical programming formulation and simple metaheuristics for solving it. The formulation is based on a transformation of the input data, in such a way that a standard mathematical programming model for the Asymmetric Tr...

Information Systems are coded in a variety of programming languages ranging from production object-oriented languages to scripting languages to declarative languages. It is crucial that the programmers have a good understanding of the fundamental concepts, notations and techniques that underlie these languages and issues related to evaluating and choosing from among these languages. There exist...

The purpose of this paper is two-fold. Firstly, we show that every Cholesky-based weighted central path for semidefinite programming is analytic under strict complementarity. This result is applied to homogeneous cone programming to show that the central paths defined by the known class of optimal self-concordant barriers are analytic in the presence of strictly complementary solutions. Secondl...

The common goal of the two practices Pair Programming and Inspections is to produce high quality software. Even though they have a common goal, their approaches are different, and they are typically used in different situations. Pair programming is typically applied as a part of agile development methodologies, such as Extreme Programming, whereas Inspections are often applied in plandriven or ...