Direct shipping logistic planning for a hub‐and‐spoke network with given discrete intershipment times
From MaRDI portal
Publication:5488243
Recommendations
- scientific article; zbMATH DE number 2154258
- Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network
- scientific article; zbMATH DE number 1189258
- Flow shipment scheduling in an incomplete hub location-routing network design problem
- An efficient procedure for designing single allocation hub and spoke systems
Cites work
Cited in
(8)- scientific article; zbMATH DE number 1189258 (Why is no real title available?)
- Dantzig-Wolfe decomposition approach to the vehicle assignment problem with demand uncertainty in a hybrid hub-and-spoke network
- scientific article; zbMATH DE number 2154258 (Why is no real title available?)
- Analysis of Direct Shipping Policies in an Inventory-Routing Problem with Discrete Shipping Times
- Research on the supernetwork equalization model of multilayer attributive regional logistics integration
- A two-echelon neighborhood search algorithm for a forwarder's job assignment in a multi-agent logistics network
- A flexible logistics distribution hub model considering cost weighted time
- Flow shipment scheduling in an incomplete hub location-routing network design problem
This page was built for publication: Direct shipping logistic planning for a hub‐and‐spoke network with given discrete intershipment times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5488243)