Pages that link to "Item:Q2879522"

The following pages link to New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem (Q2879522):

Displaying 50 items.

• The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem (Q296774) (← links)
• Efficient elementary and restricted non-elementary route pricing (Q297071) (← links)
• A matheuristic approach for the pollution-routing problem (Q319140) (← links)
• The discrete time window assignment vehicle routing problem (Q319363) (← links)
• A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times (Q320872) (← links)
• On-time delivery probabilistic models for the vehicle routing problem with stochastic demands and time windows (Q320889) (← links)
• Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows (Q320995) (← links)
• Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks (Q322560) (← links)
• Lifted and local reachability cuts for the vehicle routing problem with time windows (Q336427) (← links)
• A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands (Q337090) (← links)
• Pricing routines for vehicle routing with time windows on road networks (Q337163) (← links)
• A vehicle routing problem with flexible time windows (Q337177) (← links)
• A new formulation and approach for the black and white traveling salesman problem (Q337265) (← links)
• A branch-and-price approach for a multi-period vehicle routing problem (Q337422) (← links)
• Vehicle routing problem with stochastic travel times including soft time windows and service costs (Q339568) (← links)
• Algorithms and implementation of a set partitioning approach for modular machining line design (Q339661) (← links)
• A branch-price-and-cut algorithm for the workover rig routing problem (Q339692) (← links)
• A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem (Q342059) (← links)
• Multi-neighborhood local search optimization for machine reassignment problem (Q342289) (← links)
• Approximation schemes for Euclidean vehicle routing problems with time windows (Q346518) (← links)
• Partial-route inequalities for the multi-vehicle routing problem with stochastic demands (Q406333) (← links)
• Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints (Q439444) (← links)
• A branch\&price\&cut algorithm for the vehicle routing problem with intermediate replenishment facilities (Q510949) (← links)
• Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies (Q666967) (← links)
• A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows (Q892384) (← links)
• An exact solution framework for a broad class of vehicle routing problems (Q993700) (← links)
• Total distance approximations for routing solutions (Q1628118) (← links)
• The electric two-echelon vehicle routing problem (Q1634075) (← links)
• Integrating dock-door assignment and vehicle routing with cross-docking (Q1651517) (← links)
• Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems (Q1651704) (← links)
• Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows (Q1652285) (← links)
• An open source spreadsheet solver for vehicle routing problems (Q1652315) (← links)
• A column generation approach for the location-routing problem with time windows (Q1652527) (← links)
• A branch-and-price algorithm for the minimum latency problem (Q1652580) (← links)
• Robust vehicle routing problem with hard time windows under demand and travel time uncertainty (Q1652619) (← links)
• The vehicle routing problem with service level constraints (Q1681277) (← links)
• Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms (Q1683123) (← links)
• Adaptive large neighborhood search on the graphics processing unit (Q1711444) (← links)
• Limited memory rank-1 cuts for vehicle routing problems (Q1728212) (← links)
• Route relaxations on GPU for vehicle routing problems (Q1751660) (← links)
• New benchmark instances for the capacitated vehicle routing problem (Q1752871) (← links)
• Asymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster (Q1753599) (← links)
• Branch-price-and-cut for the mixed capacitated general routing problem with time windows (Q1754228) (← links)
• Exact algorithms for the chance-constrained vehicle routing problem (Q1800993) (← links)
• Improved lower bounds and exact algorithm for the capacitated arc routing problem (Q1942278) (← links)
• Finding the nucleolus of the vehicle routing game with time windows (Q1988954) (← links)
• A branch-and-price algorithm for a vehicle routing with demand allocation problem (Q1991157) (← links)
• Minimum makespan vehicle routing problem with compatibility constraints (Q2011596) (← links)
• A lower bound for the adaptive two-echelon capacitated vehicle routing problem (Q2012880) (← links)
• Vehicle routing with endogenous learning: application to offshore plug and abandonment campaign planning (Q2028802) (← links)