Detecting infeasibility and generating cuts for mixed integer programming using constraint programming

Authors:
Alexander Bockmayr;Nicolai Pisaruk
Affiliations:
LORIA, Université Henri Poincaré, BP, Vandoeuvre-lès-Nancy, France and FB Mathematik und Informatik, DFG-Research Center Matheon, Freie Universität Berlin, Arnimallee, Berlin, ...;LORIA, Université Henri Poincaré, BP, Vandoeuvre-lès-Nancy, France
Venue:
Computers and Operations Research
Year:
2006

Citing 5
Cited 3

On integrating constraint propagation and linear programming for combinatorial optimization

AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Mixed Global Constraints and Inference in Hybrid CLP–IP Solvers

Annals of Mathematics and Artificial Intelligence
Branch-and-Check: A Hybrid Framework Integrating Mixed Integer Programming and Constraint Logic Programming

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Branch and Infer: a Unifying Framework for Integer and Finite Domain Constraint Programming

INFORMS Journal on Computing
Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems

INFORMS Journal on Computing

Checking-up on branch-and-check

CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
A cutting plane approach for integrated planning and scheduling

Computers and Operations Research
Cutting plane algorithms for solving a stochastic edge-partition problem

Discrete Optimization

Quantified Score

Hi-index	0.01

Visualization

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 present a number of computational experiments.