![]() | ![]() |
| 1998 | ||
|---|---|---|
| 1 | Irina Ioachim, Sylvie Gélinas, François Soumis, Jacques Desrosiers: A dynamic programming algorithm for the shortest path problem with time windows and linear node costs. Networks 31(3): 193-204 (1998) | |
| 1 | Jacques Desrosiers | [1] |
| 2 | Irina Ioachim | [1] |
| 3 | François Soumis | [1] |
Data released under the ODC-BY 1.0 license — See also our legal information page