Sciweavers

Share
INFORMS
1998

Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming

9 years 3 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications like scheduling, planning, transportation, assignment, and many others. Besides special purpose algorithms to compute exact or approximate solutions, there exist also general approaches to solve this kind of problem. We are interested here in two such approaches: • Integer linear programming (ILP) • Finite domain constraint programming (CP(FD)) Integer linear programming has a long tradition in operations research and has produced a large number of impressive results during the last 40 years, see for example [37, 30]. Finite domain constraint programming is a promising new approach for solving complex combinatorial problems, which combines recent progress in programming language design, like constraint logic programming[29] or concurrent constraint programming,[42] with efficient constraint solving techni...
Alexander Bockmayr, Thomas Kasper
Added 22 Dec 2010
Updated 22 Dec 2010
Type Journal
Year 1998
Where INFORMS
Authors Alexander Bockmayr, Thomas Kasper
Comments (0)
books