| Autor: |
Quang Dung Pham, Yves Deville, Pascal Van Hentenryck |
| Jazyk: |
angličtina |
| Rok vydání: |
2009 |
| Předmět: |
|
| Zdroj: |
Electronic Proceedings in Theoretical Computer Science, Vol 5, Iss Proc. LSCS 2009, Pp 5-11 (2009) |
| Druh dokumentu: |
article |
| ISSN: |
2075-2180 |
| DOI: |
10.4204/EPTCS.5.1 |
| Popis: |
Constrained Optimum Path (COP) problems appear in many real-life applications, especially on communication networks. Some of these problems have been considered and solved by specific techniques which are usually difficult to extend. In this paper, we introduce a novel local search modeling for solving some COPs by local search. The modeling features the compositionality, modularity, reuse and strengthens the benefits of Constrained-Based Local Search. We also apply the modeling to the edge-disjoint paths problem (EDP). We show that side constraints can easily be added in the model. Computational results show the significance of the approach. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
