Challenges for Constraint Programming in Networking

1. 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. 2470, p. 633. Springer, Heidelberg (2002)

   Chapter  Google Scholar 

2. 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)

   Google Scholar 

3. Cronholm, W., Ajili, F.: Strong cost-based filtering for Lagrange decomposition applied to network design. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 726–730. Springer, Heidelberg (2004)

   Chapter  Google Scholar 

4. Smith, B.: Search strategies for optimization: Modelling the SONET problem. In: 2nd International Workshop on Reformulating Constraint Satisfaction Problems, Kinsale, Ireland (2003)

   Google Scholar 

5. 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)

   Google Scholar 

6. Ouaja, W.: Integrating Lagrangian Relaxation and Constraint Programming for Multicommodity Network Routing. PhD thesis, IC-Parc, Imperial College London, University of London (2004)

   Google Scholar 

7. Ouaja, W., Richards, B.: A hybrid multicommodity routing algorithm for traffic engineering. Networks 43(3), 125–140 (2004)

   Article  MATH  MathSciNet  Google Scholar 

8. 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)

   Google Scholar 

9. 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)

   Google Scholar 

10. 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)

    Google Scholar 

11. 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)

    Google Scholar 

12. Frei, C., Faltings, B.: Resource allocation in networks using abstraction and constraint satisfaction techniques. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 204–218. Springer, Heidelberg (1999)

    Google Scholar 

13. 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)

    Google Scholar 

14. Yorke-Smith, N., Gervet, C.: On constraint problems with incomplete or erroneuos data. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, p. 766. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

15. Yorke-Smith, N.: Reliable Constraint Reasoning with Uncertain Data. PhD thesis, IC-Parc, Imperial College London, University of London (2004)

    Google Scholar 

16. Simonis, H.: Resilience analysis in MPLS networks. Technical report, Parc Technologies Ltd (2003) (submitted for publication)

    Google Scholar 

17. 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–363 (2004)

    Google Scholar 

18. 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. 2470, p. 649. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

19. 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)

    Google Scholar 

Download references