We present Branch-and-Check, a hybrid framework integrating Mixed Integer Programming and Constraint Logic Programming, which encapsulates the traditional Benders Decomposition and Branch-and-Bound as special cases. In particular we describe its relation to Benders and the use of nogoods and linear relaxations. We give two examples of how problems can be modelled and solved using Branch-and-Check and present computational results demonstrating more than order-of-magnitude speedup compared to previous approaches. We also mention important future research issues such as hierarchical, dynamic and adjustable linear relaxations.
CITATION STYLE
Thorsteinsson, E. S. (2001). Branch-and-check: A hybrid framework integrating mixed integer programming and constraint logic programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2239, pp. 16–30). Springer Verlag. https://doi.org/10.1007/3-540-45578-7_2
Mendeley helps you to discover research relevant for your work.