Work

A Local Search Modeling for Constrained Optimum Paths Problems (Extended Abstract)

Year: 2009

Type: article

Abstract: 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.

Source: Electronic Proceedings in Theoretical Computer Science

DOI: 10.4204/eptcs.5.1

Authors: Quang Dung Pham, Yves Deville, Pascal Van Hentenryck

Institutions: UCLouvain, Brown University

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

OpenAlex ID: W1990740545

FWCI:

Cites: 8

Cited by: 1

Related to: 10