Mixed Integer Linear Programming Approach for a Distance-Constrained Elementary Path Problem - Archive ouverte HAL Access content directly
Conference Papers Year :

Mixed Integer Linear Programming Approach for a Distance-Constrained Elementary Path Problem

(1) , (1) , (2) , (3) , (3)
1
2
3

Abstract

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.
Fichier principal
Vignette du fichier
DCEP_CTW.pdf (324.75 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01937008 , version 1 (27-11-2018)

Identifiers

  • HAL Id : hal-01937008 , version 1

Cite

Sébastien Francois, Rumen Andonov, Hristo Djidjev, Metodi Traikov, Nicola Yanev. Mixed Integer Linear Programming Approach for a Distance-Constrained Elementary Path Problem. CTW 2018 - 16th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Jun 2018, Paris, France. pp.1-4. ⟨hal-01937008⟩
84 View
564 Download

Share

Gmail Facebook Twitter LinkedIn More