Login / Signup
A strong flow-based formulation for the shortest path problem in digraphs with negative cycles.
Mamane Souley Ibrahim
Nelson Maculan
Michel Minoux
Published in:
Int. Trans. Oper. Res. (2009)
Keyphrases
</>
shortest path problem
directed graph
shortest path
single source
interval data
combinatorial optimization problems
multiple objectives
positive and negative
directed acyclic graph
bi objective
random walk
flow field
flow patterns
metaheuristic
mixed integer
undirected graph
greedy algorithm
data streams
high level