Pages that link to "Item:Q5894493"
From MaRDI portal
The following pages link to A column generation approach for the split delivery vehicle routing problem (Q5894493):
Displayed 22 items.
- Branch-and-cut algorithms for the split delivery vehicle routing problem (Q296858) (← links)
- An iterated local search heuristic for the split delivery vehicle routing problem (Q337288) (← links)
- A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem (Q342059) (← links)
- A randomized granular tabu search heuristic for the split delivery vehicle routing problem (Q490211) (← links)
- New exact solution approaches for the split delivery vehicle routing problem (Q1742903) (← links)
- A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups (Q1782165) (← links)
- The two-echelon capacitated electric vehicle routing problem with battery swapping stations: formulation and efficient methodology (Q1991213) (← links)
- A large neighborhood search for the pickup and delivery problem with time windows, split loads and transshipments (Q2026973) (← links)
- The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach (Q2029026) (← links)
- A branch-and-price algorithm for solving the single-hub feeder network design problem (Q2116907) (← links)
- A branch-and-price algorithm for location-routing problems with pick-up stations in the last-mile distribution system (Q2160517) (← links)
- An analytical bound on the fleet size in vehicle routing problems: a dynamic programming approach (Q2183219) (← links)
- Directed weighted improper coloring for cellular channel allocation (Q2255043) (← links)
- The split delivery vehicle routing problem with three-dimensional loading constraints (Q2282545) (← links)
- A survey on matheuristics for routing problems (Q2513752) (← links)
- The split delivery capacitated team orienteering problem (Q2811321) (← links)
- A novel approach to solve the split delivery vehicle routing problem (Q2968484) (← links)
- Iterative Column Generation Algorithm for Generalized Multi-Vehicle Covering Tour Problem (Q4689379) (← links)
- A branch-and-cut embedded matheuristic for the inventory routing problem (Q6047912) (← links)
- Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem (Q6085887) (← links)
- Exact and hyper‐heuristic solutions for the distribution‐installation problem from the VeRoLog 2019 challenge (Q6092665) (← links)
- The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm (Q6179711) (← links)