{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:56:19Z","timestamp":1725566179655},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540232414"},{"type":"electronic","value":"9783540302018"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30201-8_4","type":"book-chapter","created":{"date-parts":[[2010,9,22]],"date-time":"2010-09-22T21:14:37Z","timestamp":1285190077000},"page":"13-16","source":"Crossref","is-referenced-by-count":0,"title":["Challenges for Constraint Programming in Networking"],"prefix":"10.1007","author":[{"given":"Helmut","family":"Simonis","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1007\/3-540-46135-3_42","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"C. Pape Le","year":"2002","unstructured":"Le Pape, C., Perron, L., Regin, J., Shaw, P.: Robust and parallel solving of a network design problem. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, p. 633. Springer, Heidelberg (2002)"},{"key":"4_CR2","unstructured":"Chabrier, A.: Heuristic branch-and-price-and-cut to solve a network design problem. In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems CP-AI-OR 2003, Montreal, Canada (2003)"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1007\/978-3-540-30201-8_55","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"W. Cronholm","year":"2004","unstructured":"Cronholm, W., Ajili, F.: Strong cost-based filtering for Lagrange decomposition applied to network design. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 726\u2013730. Springer, Heidelberg (2004)"},{"key":"4_CR4","unstructured":"Smith, B.: Search strategies for optimization: Modelling the SONET problem. In: 2nd International Workshop on Reformulating Constraint Satisfaction Problems, Kinsale, Ireland (2003)"},{"key":"4_CR5","unstructured":"Ros, L., Creemers, T., Tourouta, E., Riera, J.: A global constraint model for integrated routeing and scheduling on a transmission network. In: 7th International Conference on Information Networks, Systems and Technologies (2001)"},{"key":"4_CR6","unstructured":"Ouaja, W.: Integrating Lagrangian Relaxation and Constraint Programming for Multicommodity Network Routing. PhD thesis, IC-Parc, Imperial College London, University of London (2004)"},{"issue":"3","key":"4_CR7","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1002\/net.10110","volume":"43","author":"W. Ouaja","year":"2004","unstructured":"Ouaja, W., Richards, B.: A hybrid multicommodity routing algorithm for traffic engineering. Networks\u00a043(3), 125\u2013140 (2004)","journal-title":"Networks"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Kamarainen, O., El Sakkout, H.: Local probing applied to network routing. In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems CP-AI-OR 2004, Nice, France (2004)","DOI":"10.1007\/978-3-540-24664-0_12"},{"key":"4_CR9","unstructured":"Kamarainen, O.: Local Probing - A New Framework for Combining Local Search with Backtrack Search. PhD thesis, IC-Parc, Imperial College London, University of London (2003)"},{"key":"4_CR10","unstructured":"Liatsos, V., Novello, S., El Sakkout, H.: A probe backtrack search algorithm for network routing. In: Proceedings of the Third International Workshop on Cooperative Solvers in Constraint Programming, CoSolv 2003, Kinsale, Ireland (2003)"},{"key":"4_CR11","unstructured":"Lever, J.: A local search\/constraint propagation hybrid for a network routing problem. In: The 17th International FLAIRS Conference (FLAIRS 2004), Miami Beach, Florida (2004)"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1007\/978-3-540-48085-3_15","volume-title":"Principles and Practice of Constraint Programming \u2013 CP\u201999","author":"C. Frei","year":"1999","unstructured":"Frei, C., Faltings, B.: Resource allocation in networks using abstraction and constraint satisfaction techniques. In: Jaffar, J. (ed.) CP 1999. LNCS, vol.\u00a01713, pp. 204\u2013218. Springer, Heidelberg (1999)"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Medina, A., Taft, N., Salamatian, K., Bhattacharyya, S., Diot, C.: Traffic matrices estimation: Existing techniques and new directions. In: ACM SIGCOMM 2002, Pittsburgh, PA (2002)","DOI":"10.1145\/633025.633041"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1007\/3-540-46135-3_64","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"N. Yorke-Smith","year":"2002","unstructured":"Yorke-Smith, N., Gervet, C.: On constraint problems with incomplete or erroneuos data. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, p. 766. Springer, Heidelberg (2002)"},{"key":"4_CR15","unstructured":"Yorke-Smith, N.: Reliable Constraint Reasoning with Uncertain Data. PhD thesis, IC-Parc, Imperial College London, University of London (2004)"},{"key":"4_CR16","unstructured":"Simonis, H.: Resilience analysis in MPLS networks. Technical report, Parc Technologies Ltd (2003) (submitted for publication)"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Xia, Q., Eremin, A., Wallace, M.: Problem decomposition for traffic diversions. In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems CP-AI-OR 2004, Nice, France, pp. 348\u2013363 (2004)","DOI":"10.1007\/978-3-540-24664-0_24"},{"key":"4_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1007\/3-540-46135-3_43","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"M. Lauvergne","year":"2002","unstructured":"Lauvergne, M., David, P., Bauzimault, P.: Connections reservation with rerouting for ATM networks: A hybrid approach with constraints. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, p. 649. Springer, Heidelberg (2002)"},{"key":"4_CR19","unstructured":"Loudni, S., David, P., Boizumault, P.: On-line resource allocation for ATM networks with rerouting. In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems CP-AI-OR 2003, Montreal, Canada (2003)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30201-8_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:47:48Z","timestamp":1605761268000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30201-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540232414","9783540302018"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30201-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}