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.

• A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints (Q2029262) (← links)
• Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes (Q2031089) (← links)
• Scheduling heterogeneous delivery tasks on a mixed logistics platform (Q2076846) (← links)
• Two-echelon vehicle routing problems: a literature review (Q2079391) (← links)
• Robust vehicle routing under uncertainty via branch-price-and-cut (Q2101653) (← links)
• A unified exact approach for clustered and generalized vehicle routing problems (Q2108132) (← links)
• Opportunities for reinforcement learning in stochastic dynamic vehicle routing (Q2108171) (← links)
• A branch-and-price algorithm for the ring-tree facility location problem (Q2132327) (← links)
• Branch-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations (Q2147168) (← links)
• Adapting the \textit{ng}-path relaxation for bike balancing problems (Q2157885) (← links)
• Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem (Q2158007) (← links)
• The arc-item-load and related formulations for the cumulative vehicle routing problem (Q2172084) (← links)
• Combined maintenance and routing optimization for large-scale sewage cleaning (Q2178360) (← links)
• Exact algorithms to minimize makespan on single and parallel batch processing machines (Q2183850) (← links)
• Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach (Q2184040) (← links)
• On the exact solution of vehicle routing problems with backhauls (Q2189917) (← links)
• A generic exact solver for vehicle routing and related problems (Q2196312) (← links)
• Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network (Q2197321) (← links)
• On the exact solution of a large class of parallel machine scheduling problems (Q2197322) (← links)
• A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand (Q2208355) (← links)
• Branch-and-price for a multi-attribute technician routing and scheduling problem (Q2226497) (← links)
• The inventory routing problem with demand moves (Q2226502) (← links)
• A branch-and-cut-and-price algorithm for the electric vehicle routing problem with multiple technologies (Q2226503) (← links)
• An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and delivery robots (Q2240065) (← links)
• Exact algorithms for the traveling salesman problem with draft limits (Q2256207) (← links)
• Exact solution of the soft-clustered vehicle-routing problem (Q2272311) (← links)
• Bidirectional labeling for solving vehicle routing and truck driver scheduling problems (Q2286924) (← links)
• Exact methods for mono-objective and bi-objective multi-vehicle covering tour problems (Q2294623) (← links)
• Industrial and tramp ship routing problems: closing the gap for real-scale instances (Q2294636) (← links)
• A branch-and-cut-and-price algorithm for the multi-trip separate pickup and delivery problem with time windows at customers and facilities (Q2315637) (← links)
• An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem (Q2337401) (← links)
• A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints (Q2339816) (← links)
• A branch-and-cut algorithm for the capacitated profitable tour problem (Q2339836) (← links)
• Designing vehicle routes for a mix of different request types, under time windows and loading constraints (Q2355860) (← links)
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
• Improved branch-cut-and-price for capacitated vehicle routing (Q2398107) (← links)
• Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier (Q2422737) (← links)
• Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem (Q2424767) (← links)
• Combined location and routing problems for drug distribution (Q2448896) (← links)
• Min-Max vs. Min-Sum vehicle routing: a worst-case analysis (Q2629640) (← links)
• Freight railway operator timetabling and engine scheduling (Q2629669) (← links)
• A column generation approach for a multi-attribute vehicle routing problem (Q2629734) (← links)
• A branch-cut-and-price algorithm for the traveling salesperson problem with hotel selection (Q2664333) (← links)
• The joint network vehicle routing game with optional customers (Q2668799) (← links)
• An exact solution approach for the inventory routing problem with time windows (Q2669489) (← links)
• Selective routing problem with synchronization (Q2669549) (← links)
• A POPMUSIC matheuristic for the capacitated vehicle routing problem (Q2669570) (← links)
• An \(\varepsilon \)-constraint column generation-and-enumeration algorithm for bi-objective vehicle routing problems (Q2669681) (← links)
• A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem (Q2688881) (← links)
• A directional heuristics pulse algorithm for a two resources constrained shortest path problem with reinitialization (Q2691338) (← links)