Simple bounds and greedy algorithms for decomposing a flow into a minimal set of paths
Year of publication: |
2008
|
---|---|
Authors: | Vatinlen, B. ; Chauvet, F. ; Chretienne, P. ; Mahey, P. |
Published in: |
European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 185.2008, 3, p. 1390-1401
|
Publisher: |
Elsevier |
Saved in:
Saved in favorites
Similar items by person
-
Simple bounds and greedy algorithms for decomposing a flow into a minimal set of paths
Vatinlen, B., (2008)
-
Scheduling theory and its applications
Chretienne, P., (1997)
-
A cutting plane algorithm for the unrelated parallel machine scheduling problem
Mokotoff, E., (2002)
- More ...