Pages that link to "Item:Q3100458"

The following pages link to Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows (Q3100458):

Displaying 50 items.

• Branch-and-cut algorithms for the split delivery vehicle routing problem (Q296858) (← links)
• Alternative approaches to the crude oil tanker routing and scheduling problem with split pickup and split delivery (Q319010) (← links)
• Two exact algorithms for the traveling umpire problem (Q319246) (← links)
• The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach (Q320623) (← links)
• Liner shipping network design with deadlines (Q336778) (← links)
• A branch-price-and-cut method for a ship routing and scheduling problem with split loads (Q339703) (← links)
• A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem (Q342059) (← links)
• Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery (Q376001) (← links)
• Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery (Q408394) (← links)
• A randomized granular tabu search heuristic for the split delivery vehicle routing problem (Q490211) (← links)
• A note on branch-and-cut-and-price (Q613321) (← links)
• Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies (Q666967) (← links)
• A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen (Q1617109) (← links)
• Scheduling cleaning activities on trains by minimizing idle times (Q1707827) (← links)
• New exact solution approaches for the split delivery vehicle routing problem (Q1742903) (← links)
• A branch and price algorithm to solve the integrated production planning and scheduling in bulk ports (Q1751727) (← links)
• Branch-price-and-cut for the mixed capacitated general routing problem with time windows (Q1754228) (← links)
• A tabu search heuristic for the vehicle routing problem with time windows and split deliveries (Q1879783) (← links)
• Integer linear programming models for a cement delivery problem (Q1926974) (← links)
• A branch-and-price algorithm for a vehicle routing with demand allocation problem (Q1991157) (← links)
• Column generation for vehicle routing problems with multiple synchronization constraints (Q1991183) (← 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 route decomposition approach for the single commodity split pickup and split delivery vehicle routing problem (Q2029263) (← links)
• Parameterized algorithms and complexity for the traveling purchaser problem and its variants (Q2084609) (← links)
• The prisoner transportation problem (Q2178139) (← links)
• Combined maintenance and routing optimization for large-scale sewage cleaning (Q2178360) (← links)
• The fuel replenishment problem: a split-delivery multi-compartment vehicle routing problem with multiple trips (Q2185519) (← links)
• Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network (Q2197321) (← links)
• A column generation-based heuristic for the split delivery vehicle routing problem with time windows (Q2226483) (← links)
• A branch-and-price algorithm for the liner shipping network design problem (Q2226484) (← links)
• The inventory routing problem with demand moves (Q2226502) (← links)
• Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints (Q2256169) (← links)
• Branch and price for the vehicle routing problem with discrete Split deliveries and time windows (Q2275800) (← links)
• The nuclear medicine production and delivery problem (Q2356256) (← 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)
• Synchronized routing of active and passive means of transport (Q2454366) (← links)
• Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems (Q2655613) (← links)
• An exact solution approach for the inventory routing problem with time windows (Q2669489) (← links)
• The split delivery capacitated team orienteering problem (Q2811321) (← links)
• The fixed-charge shortest-path problem (Q2815469) (← links)
• Integrated Charge Batching and Casting Width Selection at Baosteel (Q2931698) (← links)
• Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows (Q2957464) (← links)
• The Surgical Patient Routing Problem: A Central Planner Approach (Q2960361) (← links)
• Regenerator Location Problem in Flexible Optical Networks (Q4604897) (← links)
• Particle Swarm Optimization for Split Delivery Vehicle Routing Problem (Q4642133) (← links)
• Vehicle routing problems with split deliveries (Q4918250) (← links)
• The Migratory Beekeeping Routing Problem: Model and an Exact Algorithm (Q4995073) (← links)