Simple bounds and greedy algorithms for decomposing a flow into a minimal set of paths

13 years 11 months ago

Given arbitrary source and target nodes s, t and an s

Benedicte Vatinlen, Fabrice Chauvet, Philippe Chr&

Arbitrary Source | EOR 2008 | Optimal Solution | Solutions |

claim paper

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	EOR
Authors	Benedicte Vatinlen, Fabrice Chauvet, Philippe Chrétienne, Philippe Mahey

Comments (0)