Showing 1 - 10 of 186
We study a variation of the packing-delivery problem, which involves K distinct products, a single capacitated truck, and a fixed sequence of customer locations to be visited. We show that the non-split version of the problem is strongly polynomial solvable. For the split delivery case, we...
Persistent link: https://www.econbiz.de/10009202448
Persistent link: https://www.econbiz.de/10007905759
Persistent link: https://www.econbiz.de/10008886946
Persistent link: https://www.econbiz.de/10015407099
Persistent link: https://www.econbiz.de/10006506736
Persistent link: https://www.econbiz.de/10006270184
Persistent link: https://www.econbiz.de/10005347058
Persistent link: https://www.econbiz.de/10008253188
Persistent link: https://www.econbiz.de/10008890727
Persistent link: https://www.econbiz.de/10002418721