Pages that link to "Item:Q4651933"

The following pages link to An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems (Q4651933):

Displaying 50 items.

• The orienteering problem with time windows applied to robotic melon harvesting (Q255095) (← links)
• The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem (Q296774) (← links)
• A priori orienteering with time windows and stochastic wait times at customers (Q297061) (← links)
• Efficient elementary and restricted non-elementary route pricing (Q297071) (← links)
• Two exact algorithms for the traveling umpire problem (Q319246) (← 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)
• Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem (Q320880) (← links)
• Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows (Q320995) (← links)
• Integer programming formulations for the elementary shortest path problem (Q322844) (← links)
• The electric fleet size and mix vehicle routing problem with time windows and recharging stations (Q323018) (← links)
• A branch-and-price based heuristic for the stochastic vehicle routing problem with hard time windows (Q325476) (← 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)
• Metaheuristic algorithms for solving two interconnected vehicle routing problems in a hospital complex (Q336558) (← 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 new formulation and approach for the black and white traveling salesman problem (Q337265) (← links)
• Solving the orienteering problem with time windows via the pulse framework (Q337360) (← links)
• A branch-and-price approach for a multi-period vehicle routing problem (Q337422) (← links)
• Implementation of a three-stage approach for the dynamic resource-constrained shortest-path sub-problem in branch-and-price (Q339594) (← links)
• Models and hybrid methods for the onshore wells maintenance problem (Q339625) (← links)
• A branch-price-and-cut algorithm for the workover rig routing problem (Q339692) (← links)
• A branch-price-and-cut method for a ship routing and scheduling problem with split loads (Q339703) (← links)
• Time-dependent routing problems: a review (Q342083) (← links)
• Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework (Q363544) (← links)
• Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem (Q375997) (← links)
• A set-covering based heuristic algorithm for the periodic vehicle routing problem (Q406496) (← links)
• Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints (Q439444) (← links)
• Column generation for extended formulations (Q458128) (← links)
• A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration (Q483728) (← links)
• A new warmstarting strategy for the primal-dual column generation method (Q494315) (← links)
• A branch\&price\&cut algorithm for the vehicle routing problem with intermediate replenishment facilities (Q510949) (← links)
• Exact methods for solving the elementary shortest and longest path problems (Q512936) (← links)
• A column generation algorithm for the vehicle routing problem with soft time windows (Q538287) (← links)
• An efficient column-generation-based algorithm for solving a pickup-and-delivery problem (Q547107) (← links)
• A note on branch-and-cut-and-price (Q613321) (← links)
• Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation (Q632696) (← links)
• A tutorial on column generation and branch-and-price for vehicle routing problems (Q633483) (← links)
• The orienteering problem with stochastic travel and service times (Q646634) (← links)
• Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies (Q666967) (← links)
• Arcs-states models for the vehicle routing problem with time windows and related problems (Q856684) (← links)
• An exact algorithm for a single-vehicle routing problem with time windows and multiple routes (Q859687) (← links)
• A general heuristic for vehicle routing problems (Q869003) (← links)
• Arc routing problems with time-dependent service costs (Q872235) (← links)
• A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows (Q892384) (← links)
• The aircraft routing problem with refueling (Q895787) (← links)
• A branch and bound method for the job-shop problem with sequence-dependent setup times (Q940884) (← links)
• Pruning in column generation for service vehicle dispatching (Q940899) (← links)
• The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach (Q958447) (← links)