Login / Signup
Simple bounds and greedy algorithms for decomposing a flow into a minimal set of paths.
Benedicte Vatinlen
Fabrice Chauvet
Philippe Chrétienne
Philippe Mahey
Published in:
Eur. J. Oper. Res. (2008)
Keyphrases
</>
greedy algorithms
greedy algorithm
neural network
three dimensional
lower bound
worst case
databases
learning environment
search algorithm
upper bound
shortest path
knapsack problem
approximation algorithms
upper and lower bounds
highly reliable