Pages that link to "Item:Q2514736"
From MaRDI portal
The following pages link to A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes (Q2514736):
Displaying 8 items.
- Making the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problem (Q1751783) (← links)
- A comparison of two meta-heuristics for the pickup and delivery problem with transshipment (Q1782171) (← links)
- Exact solutions for the collaborative pickup and delivery problem (Q1787916) (← links)
- The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach (Q2029026) (← links)
- New mixed integer-programming model for the pickup-and-delivery problem with transshipment (Q2256318) (← links)
- The multi-vehicle profitable pickup and delivery problem (Q2362250) (← links)
- An adaptive tabu search algorithm embedded with iterated local search and route elimination for the bike repositioning and recycling problem (Q2664364) (← links)
- Exact Approach for Integrated Delivery Optimization of E-Commerce and Online-to-Offline Parcels (Q6053530) (← links)
