Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
From MaRDI portal
Publication:4427349
DOI10.1287/ijoc.10.3.287zbMath1034.90517MaRDI QIDQ4427349
Alexander Bockmayr, Thomas Kasper
Publication date: 1998
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/fe738e45e8cf3b4a8952bb729c26fbe9289e6d86
Related Items
Constraint Integer Programming: A New Approach to Integrate CP and MIP, Branch and Win: OR tree search algorithms for solving combinatorial optimisation problems., Mixed global constraints and inference in hybrid CLP--IP solvers, Constraint satisfaction problems: Algorithms and applications, Detecting infeasibility and generating cuts for mixed integer programming using constraint programming, A unified framework for partial and hybrid search methods in constraint programming, Accelerating column generation for aircraft scheduling using constraint propagation, Searching for mutually orthogonal Latin squares via integer and constraint programming
Uses Software