Pages that link to "Item:Q4599317"

The following pages link to New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows (Q4599317):

Displaying 38 items.

• Lifted and local reachability cuts for the vehicle routing problem with time windows (Q336427) (← links)
• A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen (Q1617109) (← links)
• Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems (Q1651704) (← links)
• A branch-and-price algorithm for the minimum latency problem (Q1652580) (← links)
• An improved LNS algorithm for real-time vehicle routing problem with time windows (Q1761960) (← links)
• Solving bin packing problems using VRPSolver models (Q2033390) (← links)
• Scheduling heterogeneous delivery tasks on a mixed logistics platform (Q2076846) (← links)
• Robust drone selective routing in humanitarian transportation network assessment (Q2083969) (← links)
• Robust vehicle routing under uncertainty via branch-price-and-cut (Q2101653) (← links)
• New exact and heuristic algorithms to solve the prize-collecting job sequencing problem with one common and multiple secondary resources (Q2106718) (← links)
• The pickup and delivery problem with time windows, multiple stacks, and handling operations (Q2140213) (← links)
• A generic exact solver for vehicle routing and related problems (Q2196312) (← links)
• On the exact solution of a large class of parallel machine scheduling problems (Q2197322) (← links)
• A column generation-based heuristic for the split delivery vehicle routing problem with time windows (Q2226483) (← links)
• Branch-and-price for a multi-attribute technician routing and scheduling problem (Q2226497) (← links)
• Industrial and tramp ship routing problems: closing the gap for real-scale instances (Q2294636) (← links)
• Routing optimization with time windows under uncertainty (Q2414906) (← links)
• On the complete set packing and set partitioning polytopes: properties and rank 1 facets (Q2417173) (← links)
• Formulations and exact algorithms for the vehicle routing problem with time windows (Q2468488) (← links)
• New route relaxation and pricing strategies for the vehicle routing problem (Q2879522) (← links)
• Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows (Q3392186) (← links)
• (Q3783826) (← links)
• Robust Data-Driven Vehicle Routing with Time Windows (Q4994169) (← links)
• The Migratory Beekeeping Routing Problem: Model and an Exact Algorithm (Q4995073) (← links)
• Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization (Q5086000) (← links)
• A hybrid algorithm for the drilling rig routing problem (Q5100126) (← links)
• A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation (Q5106379) (← links)
• Branch-and-Price Approaches for Real-Time Vehicle Routing with Picking, Loading, and Soft Time Windows (Q5106417) (← links)
• A rollout algorithm for the resource constrained elementary shortest path problem (Q5198052) (← links)
• Path inequalities for the vehicle routing problem with time windows (Q5295485) (← links)
• Estimating the marginal cost to deliver to individual customers (Q6088526) (← links)
• Selective arc‐ng pricing for vehicle routing (Q6092607) (← links)
• Linear edge costs and labeling algorithms: The case of the time‐dependent vehicle routing problem with time windows (Q6092647) (← links)
• Planning robust drone-truck delivery routes under road traffic uncertainty (Q6112843) (← links)
• Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows (Q6113315) (← links)
• A unified exact approach for a broad class of vehicle routing problems with simultaneous pickup and delivery (Q6551059) (← links)
• Delay-resistant robust vehicle routing with heterogeneous time windows (Q6551164) (← links)
• Partial dominance in branch-price-and-cut algorithms for vehicle routing and scheduling problems with a single-segment tradeoff (Q6667800) (← links)