## Abstract

This paper describes our experience in implementing an industrial application using the finite domain solver of the ECL^{i}PS^{e} constraint logic programming (CLP) system, in conjunction with the mathematical programming (MP) system, FortMP. In this technique, the ECL^{i}PS^{e} system generates a feasible solution that is adapted to construct a starting point (basic solution) for the MP solver. The basic solution is then used as an input to the FortMP system to warm-start the simplex (SX) algorithm, hastening the solution of the linear programming relaxation, (LPR). SX proceeds as normal to find the optimal integer solution. Preliminary results indicate that the integration of the two environments is suitable for this application in particular, and may generally yield significant benefits. We describe adaptations required in the hybrid method, and report encouraging experimental results for this problem.

Original language | English |
---|---|

Pages (from-to) | 421-431 |

Number of pages | 11 |

Journal | Annals of Operations Research |

Volume | 81 |

Publication status | Published - 1 Dec 1998 |

Externally published | Yes |

## Keywords

- Branch and bound
- Combinatorial optimisation
- Constraint satisfaction
- Finite domain propagation
- Integer programming
- Simplex method