Articles
An example of integrating constraint programming and mathematical programming

https://doi.org/10.1016/S1571-0653(05)80001-0Get rights and content

Abstract

This paper describes an integration of finite domain constraint programming techniques into mathematical programming, with an implementation of this new solution approach based on a commercial linear mixed-integer tool and a finite domain CP solver over unions of integer intervals. The combined modelling and problem solving approach has been applied to test problems of different types and dimensions. We comment on the results of these experiments.

References (0)

Cited by (8)

  • A hybrid MILP/CLP algorithm for multipurpose batch process scheduling

    2005, Computers and Chemical Engineering
    Citation Excerpt :

    Trentesaux, Pesin, and Tahon (2001) compared CLP techniques using the CHIP system to alternative AI methods and concluded that, while CLP can be used to solve job-shop scheduling problems it is best used to generate feasible solutions within an area of the search space defined by another, more general method. Heipcke (1999) compared CLP and MILP methods of solving several standard problems, including the change problem and production process scheduling. This work shows that the ability of CLP to handle disjunctive constraints makes it a good choice for scheduling problems, but finding a provably optimal solution is more difficult than in MILP.

  • Part II. Future perspective on optimization

    2004, Computers and Chemical Engineering
  • Constraint programming based robust sensor network design

    2007, Industrial and Engineering Chemistry Research
View all citing articles on Scopus
View full text