Pages that link to "Item:Q1755394"
From MaRDI portal
The following pages link to A generalized bin packing problem for parcel delivery in last-mile logistics (Q1755394):
Displaying 13 items.
- A covering traveling salesman problem with profit in the last mile delivery (Q2070135) (← links)
- Homogeneous grouping of non-prime steel products for online auctions: a case study (Q2159574) (← links)
- Compact integer linear programming formulations for the temporal bin packing problem with fire-ups (Q2668727) (← links)
- Multi-period bin packing model and effective constructive heuristics for corridor-based logistics capacity planning (Q2668752) (← links)
- Last-Mile Shared Delivery: A Discrete Sequential Packing Approach (Q3387932) (← links)
- Two-echelon collaborative routing problem with heterogeneous crowd-shippers (Q6068714) (← links)
- Robust planning of sorting operations in express delivery systems (Q6106487) (← links)
- A branch-and-bound approach for a vehicle routing problem with customer costs (Q6114901) (← links)
- Worst-case analysis of heuristic approaches for the temporal bin packing problem with fire-ups (Q6491686) (← links)
- Benders decomposition for robust distribution network design and operations in online retailing (Q6586233) (← links)
- Tighter bounds for the harmonic bin packing algorithm (Q6586257) (← links)
- Algorithms for the bin packing problem with scenarios (Q6646755) (← links)
- Performance evaluation of sustainable downstream logistics: a hybrid multi criteria decision making framework (Q6660093) (← links)