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 problems, with best results often obtained by a combination of different solution techniques. Teams at Parc Technologies and IC-Parc have been working in this field over the last years, with a number of applications now embedded in commercial products.

• Type: Conference
• Year: 2004
• Where: CP
• Authors: Helmut Simonis
• Keywords: Complex Problem Structures, CP 2004, Huge Practical Importance, Hybrid Cp Solutions, Programming Languages