January 2001, Volume 52, Issue 1, Pages 82 - 92

Theoretical Paper

Enhancing the performance of constraint programming through the introduction of linear programming J Little Department of Mathematical Sciences, Brunel University, UK     Correspondence to: J Little, Department of Mathematical Sciences, Brunel University, Uxbridge, Middlesex UB8 3PH, UK.

Keywords

integer programming;   linear programming;   constraint programming

Abstract

Constraint Programming (CP) has been successful in a number of combinatorial search and discrete optimisation problems. Yet other more traditional approaches, such as Integer Programming (IP), can still give a better performance on the same problem types. Central to IP's success is its reliance on a fast Linear Programming (LP) solver providing solutions during the search to the corresponding relaxed problems. These solutions are used to guide the search within IP as well as a means of detecting infeasibility and integrality. This paper shows that there is scope also to include LP within the CP framework, in order to similarly guide the CP search. The problems examined here are one for which CP on its own had proved markedly inferior to IP. Hence a hybrid solver based on the CP search and using an LP solver is configured and run on these problems. The outcome shows that using the LP solver within the CP search is a valuable addition to the available search strategies. An improved performance over the CP-only strategies is obtained and, further, comparable results are obtained to those from IP. Overall, CP+LP can be considered as a more robust approach than either CP or IP on their own on a variety of combinatorial search problems.

Received November 1999; Accepted August 2000

^© Macmillan Publishers Ltd 2001