Pages that link to "Item:Q2275800"
From MaRDI portal
The following pages link to Branch and price for the vehicle routing problem with discrete Split deliveries and time windows (Q2275800):
Displaying 12 items.
- Workforce scheduling and routing problems: literature survey and computational study (Q284388) (← links)
- An ant colony system for responsive dynamic vehicle routing (Q319660) (← links)
- A heuristic approach to a single stage assembly problem with transportation allocation (Q387489) (← links)
- Integrated districting, fleet composition, and inventory planning for a multi-retailer distribution system (Q1730678) (← links)
- A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups (Q1782165) (← links)
- The prisoner transportation problem (Q2178139) (← links)
- Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach (Q2184040) (← links)
- Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints (Q2256169) (← links)
- A multi-trip split-delivery vehicle routing problem with time windows for inventory replenishment under stochastic travel times (Q2358098) (← links)
- Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem (Q2424767) (← links)
- A survey of resource constrained shortest path problems: Exact solution approaches (Q2811308) (← links)
- A rollout algorithm for the resource constrained elementary shortest path problem (Q5198052) (← links)
