Integer Programming and Constraint Programming

and constraint programming and the goal of the talk is to
rise interest and to start a SIG. This will not(!!) be a
polished presentation.

Both approaches to solving hard
combinatorial problems have a history in AG1 and AG2 and also
in the computer science department (Gerd Smolka's group).

I will rise four issues:

1. High-Level Constraints for Integer Linear Programming
2. Library of Separation Routines
3. Efficient Algorithms for Narrowing
4. Integer Linear Programming and Constraint Programming.