Challenges for Constraint Programming in Networking

In this talk we present a number of problems for network design, planning and analysis and show how they can be addressed with different hybrid CP solutions. Clearly, this problem domain is of huge practical importance, but it also provides us with interesting, complex problem structures. CP directly competes with MILP and local search approaches to these… CONTINUE READING