| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6896964 | European Journal of Operational Research | 2015 | 4 Pages |
Abstract
This note suggests faster algorithms for two integrated production/distribution problems studied earlier, improving their complexities from O(n2V + 4) and O(n2(L + V)2) to O(n) and O(n + Vminâ{V, n}) respectively, where n is the number of products to be delivered, V is the number of vehicles and L is the number of vehicle departure times.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Alessandro Agnetis, Mohamed Ali Aloulou, Liang-Liang Fu, Mikhail Y. Kovalyov,