Detecting Infeasibility and Generating Cuts for MIP using CP

Alexander Bockmayr 1 Nicolai Pisaruk 1
1 MODBIO - Computational models in molecular biology
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We study a hybrid MIP/CP solution approach in which CP is used for detecting infeasibilities and generating cuts within a branch-and-cut algorithm for MIP. Our framework applies to MIP problems augmented by monotone constraints that can be handled by CP. We illustrate our approach on a generic multiple machine scheduling problem, and compare it to other hybrid MIP/CP algorithms.
Type de document :
Communication dans un congrès
5th International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems - CPAIOR'03, 2003, Montréal, Canada, 11 p, 2003
Liste complète des métadonnées

Littérature citée [11 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00107699
Contributeur : Publications Loria <>
Soumis le : jeudi 19 octobre 2006 - 09:05:38
Dernière modification le : jeudi 11 janvier 2018 - 06:19:51
Document(s) archivé(s) le : mercredi 29 mars 2017 - 13:24:31

Identifiants

  • HAL Id : inria-00107699, version 1

Collections

Citation

Alexander Bockmayr, Nicolai Pisaruk. Detecting Infeasibility and Generating Cuts for MIP using CP. 5th International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems - CPAIOR'03, 2003, Montréal, Canada, 11 p, 2003. 〈inria-00107699〉

Partager

Métriques

Consultations de la notice

94

Téléchargements de fichiers

75