Constraint-based local search for constrained optimum paths problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6140 LNCS, Issue , 2010, Pages 267-281

  Pham, Quang Dung ^a   Deville, Yves ^a   Van Hentenryck, Pascal ^b  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

^b BROWN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION NETWORKS; COMPOSITIONAL MODELS; COMPOSITIONALITY; COMPUTATIONAL RESULTS; CONSTRAINT-BASED; EDGE-DISJOINT PATHS; HIGH LEVEL OF ABSTRACTION; HIGH-QUALITY SOLUTIONS; LOCAL SEARCH; REAL-LIFE APPLICATIONS; RESOURCE-CONSTRAINED; SEARCH PROCEDURES; SIDE CONSTRAINTS; SPANNING TREE; TECHNICAL CONTRIBUTION;

COMPUTER PROGRAMMING; CONSTRAINT THEORY; GRAPH THEORY; TELECOMMUNICATION NETWORKS;

COMBINATORIAL OPTIMIZATION;

EID: 77955436284     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13520-0_29     Document Type: Conference Paper

References (10)

1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, New Jersey (1993)
2. Beasley, J.E.: Or-library, http://people.brunel.ac.uk/~mastjjb/jeb/info. html
3. Beasley, J.E., Christofides, N.: An algorithm for the resource constrained shortest path problem. Network 19, 379-394 (1989)
4. Blesa, M., Blum, C.: Finding edge-disjoint paths in networks: An ant colony optimization algorithm. Journal of Mathematical Modelling and Algorithms 6(3), 361-391 (2007)
5. Carlyle, W.M., Wood, R.K.: Lagrangian relaxation and enumeration for solving constrained shortest-path problems. In: Proceedings of the 38th Annual ORSNZ Conference (2003)
6. Clímaco, J.C.N., Craveirinha, J.M.F., Pascoal, M.M.B.: A bicriterion approach for routing problems in multimedia networks. Network 41, 206-220 (2003)
7. Dumitrescu, I., Boland, N.: Improved preprocessing, labeling and scaling algorithms for the weight-constrained shortest path problem. Networks 42, 135-153 (2003) (Pubitemid 37178087)
8. Pham, Q.D., Deville, Y., Van Hentenryck, P.: Ls(graph & tree): A local search framework for constraint optimization on graphs and trees. In: Proceedings of the 24th Annual ACM Symposium on Applied Computing (SAC 2009) (2009)
9. Smilowitz, K.: Multi-resource routing with flexible tasks: an application in drayage operation. IIE Transactions 38(7), 555-568 (2006)
10. Van Hentenryck, P., Michel, L.: Constraint-based local search. The MIT Press, London (2005)