Mixed Integer Linear Programming Approach for a Distance-Constrained Elementary Path Problem
Résumé
Given a directed graph G = (V, E, l) with weights l e ≥ 0 associated with arcs e ∈ E and a set of vertex pairs with distances between them (called distance constraints), the problem is to find an elementary path in G that satisfies a maximum number of distance constraints. We describe two MIP formulations for this problem and discuss their advantages.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...