Pages that link to "Item:Q2489135"

The following pages link to Vehicle routing problem with elementary shortest path based column generation (Q2489135):

Displaying 40 items.

• Branch-and-price and constraint programming for solving a real-life technician dispatching problem (Q296755) (← links)
• Efficient elementary and restricted non-elementary route pricing (Q297071) (← links)
• Lifted and local reachability cuts for the vehicle routing problem with time windows (Q336427) (← links)
• Using the primal-dual interior point algorithm within the branch-price-and-cut method (Q336429) (← links)
• Enhanced compact models for the connected subgraph problem and for the shortest path problem in digraphs with negative cycles (Q336550) (← links)
• Pricing routines for vehicle routing with time windows on road networks (Q337163) (← links)
• Models and hybrid methods for the onshore wells maintenance problem (Q339625) (← links)
• Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework (Q363544) (← links)
• Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints (Q439444) (← links)
• A tutorial on column generation and branch-and-price for vehicle routing problems (Q633483) (← links)
• Chebyshev center based column generation (Q765323) (← links)
• A general heuristic for vehicle routing problems (Q869003) (← links)
• The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach (Q958447) (← links)
• Decomposition, reformulation, and diving in university course timetabling (Q1038298) (← links)
• A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows (Q1040973) (← links)
• A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen (Q1617109) (← links)
• A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs (Q1652714) (← links)
• Vehicle routing under time-dependent travel times: the impact of congestion avoidance (Q1762059) (← links)
• The home care crew scheduling problem: preference-based visit clustering and temporal dependencies (Q1926679) (← links)
• Air cargo scheduling: integrated models and solution procedures (Q1944877) (← links)
• A column generation and a post optimization VNS heuristic for the vehicle routing problem with multiple time Windows (Q2070117) (← links)
• A robust optimization approach with probe-able uncertainty (Q2239954) (← links)
• A branch-and-cut algorithm for the capacitated profitable tour problem (Q2339836) (← links)
• Branch-and-price for staff rostering: an efficient implementation using generic programming and nested column generation (Q2355925) (← links)
• The nuclear medicine production and delivery problem (Q2356256) (← links)
• A heuristic for cumulative vehicle routing using column generation (Q2357169) (← links)
• Single vehicle routing with predefined client sequence and multiple warehouse returns: the case of two warehouses (Q2358165) (← links)
• Formulations and exact algorithms for the vehicle routing problem with time windows (Q2468488) (← links)
• Lagrangian duality applied to the vehicle routing problem with time windows (Q2496037) (← links)
• Vehicle routing with soft time windows and stochastic travel times: a column generation and branch-and-price solution approach (Q2514731) (← links)
• Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems (Q2655613) (← links)
• A survey of resource constrained shortest path problems: Exact solution approaches (Q2811308) (← links)
• A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows (Q3057119) (← links)
• The vehicle routing problem with time windows and temporal dependencies (Q3113512) (← links)
• Chvátal-Gomory Rank-1 Cuts Used in a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem with Time Windows (Q3564367) (← links)
• Integrated optimization of planetary rover layout and exploration routes (Q5058710) (← links)
• Branch-and-Price Approaches for Real-Time Vehicle Routing with Picking, Loading, and Soft Time Windows (Q5106417) (← links)
• Joint vehicle assembly‐routing problems: An integrated modeling and optimization approach (Q5191146) (← links)
• Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows (Q6160235) (← links)
• New Refinements for the Solution of Vehicle Routing Problems with Branch and Price (Q6160335) (← links)