Pages that link to "Item:Q5894493"

The following pages link to A column generation approach for the split delivery vehicle routing problem (Q5894493):

Displaying 35 items.

• Branch-and-cut algorithms for the split delivery vehicle routing problem (Q296858) (← links)
• A comparison of column-generation approaches to the synchronized pickup and delivery problem (Q319923) (← 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)
• A ring-based diversification scheme for routing problems (Q843395) (← 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)
• A genetic column generation algorithm for sustainable spare part delivery: application to the Sydney droppoint network (Q2196017) (← links)
• A matheuristic approach for the split delivery vehicle routing problem: an efficient set covering-based model with guided route generation schemes (Q2205074) (← links)
• A column generation-based heuristic for the split delivery vehicle routing problem with time windows (Q2226483) (← links)
• Directed weighted improper coloring for cellular channel allocation (Q2255043) (← links)
• Branch and price for the vehicle routing problem with discrete Split deliveries and time windows (Q2275800) (← links)
• The split delivery vehicle routing problem with three-dimensional loading constraints (Q2282545) (← links)
• Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem (Q2424767) (← links)
• A survey on matheuristics for routing problems (Q2513752) (← links)
• A column generation approach for a multi-attribute vehicle routing problem (Q2629734) (← links)
• The split delivery capacitated team orienteering problem (Q2811321) (← links)
• A novel approach to solve the split delivery vehicle routing problem (Q2968484) (← links)
• Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows (Q3100458) (← links)
• Nested column generation applied to the crude oil tanker routing and scheduling problem with split pickup and split delivery (Q3120561) (← links)
• A SPLIT DELIVERY VEHICLE ROUTING PROBLEM (Q4345056) (← links)
• Iterative Column Generation Algorithm for Generalized Multi-Vehicle Covering Tour Problem (Q4689379) (← links)
• A column generation approach for the split delivery vehicle routing problem (Q5900196) (← 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)
• Nested column generation for split pickup vehicle routing problem with time windows and time-dependent demand (Q6551134) (← links)