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

DOI10.1016/j.cor.2005.01.010zbMath1086.90041OpenAlexW2003662489MaRDI QIDQ2489122

Nicolai Pisaruk, Alexander Bockmayr

Publication date: 16 May 2006

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2005.01.010

zbMATH Keywords

Integer programmingCutting planeConstraint programmingHybrid solver

Mathematics Subject Classification ID

Boolean programming (90C09)

Related Items

Constraint programming and operations research, Temporal linear relaxation in IBM ILOG CP optimizer, Multi-stage Benders Decomposition for Optimizing Multicore Architectures, Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling, A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates, A cutting plane approach for integrated planning and scheduling, Optimal resource allocation and scheduling for the CELL BE platform, Searching for mutually orthogonal Latin squares via integer and constraint programming, Cutting plane algorithms for solving a stochastic edge-partition problem

Uses Software

• CHIP
• Mosel

Cites Work

• Mixed global constraints and inference in hybrid CLP--IP solvers
• Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
• Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item