TY - CHAP
T1 - Challenges for constraint programming in networking
AU - Simonis, Helmut
PY - 2004
Y1 - 2004
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/35048864931
U2 - 10.1007/978-3-540-30201-8_4
DO - 10.1007/978-3-540-30201-8_4
M3 - Chapter
AN - SCOPUS:35048864931
SN - 3540232419
SN - 9783540232414
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 13
EP - 16
BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
A2 - Wallace, Mark
PB - Springer Verlag
ER -