Pages that link to "Item:Q6112842"
From MaRDI portal
The following pages link to A branch-and-price-and-cut algorithm for the truck-based drone delivery routing problem with time windows (Q6112842):
Displaying 10 items.
- An improved edge recombination algorithm for scheduling problems of drone package delivery (Q5031920) (← links)
- Parcel delivery cost minimization with time window constraints using trucks and drones (Q6065834) (← links)
- A b<scp>ranch‐and‐cut</scp> approach and alternative formulations for the traveling salesman problem with drone (Q6092656) (← links)
- A branch‐and‐price‐and‐cut algorithm for the truck‐drone routing problem with simultaneously delivery and pickup (Q6150242) (← links)
- Nested column generation for split pickup vehicle routing problem with time windows and time-dependent demand (Q6551134) (← links)
- Exact solution method for vehicle-and-drone cooperative delivery routing of blood products (Q6551173) (← links)
- A parallel branch-and-bound heuristic for the integrated long-haul and local vehicle routing problem on an adaptive transportation network (Q6561217) (← links)
- Facility location decisions for drone delivery with riding: a literature review (Q6568491) (← links)
- Hybrid truck-drone delivery system with multi-visits and multi-launch and retrieval locations: mathematical model and adaptive variable neighborhood search with neighborhood categorization (Q6586259) (← links)
- Fleet resupply by drones for last-mile delivery (Q6586265) (← links)
