Pages that link to "Item:Q993700"
From MaRDI portal
The following pages link to An exact solution framework for a broad class of vehicle routing problems (Q993700):
Displaying 36 items.
- Thirty years of heterogeneous vehicle routing (Q320861) (← links)
- Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks (Q322560) (← links)
- The electric fleet size and mix vehicle routing problem with time windows and recharging stations (Q323018) (← links)
- A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands (Q337090) (← links)
- A branch-price-and-cut algorithm for the workover rig routing problem (Q339692) (← links)
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints (Q439444) (← links)
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts (Q948965) (← links)
- An open source spreadsheet solver for vehicle routing problems (Q1652315) (← links)
- Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms (Q1683123) (← links)
- A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet (Q1730643) (← links)
- Restricted dynamic programming: a flexible framework for solving realistic VRPs (Q1762058) (← links)
- The vehicle routing-allocation problem: A unifying framework (Q1814811) (← links)
- A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints (Q2010923) (← links)
- Accounting for cost heterogeneity on the demand in the context of a technician dispatching problem (Q2023966) (← links)
- An exact solution method for a rich helicopter flight scheduling problem arising in offshore oil and gas logistics (Q2027044) (← links)
- Using VRPSolver to efficiently solve the \textsc{differential harvest problem} (Q2108125) (← links)
- A unified exact approach for clustered and generalized vehicle routing problems (Q2108132) (← links)
- Deep infeasibility exploration method for vehicle routing problems (Q2163783) (← links)
- A generic exact solver for vehicle routing and related problems (Q2196312) (← links)
- Bidirectional labeling for solving vehicle routing and truck driver scheduling problems (Q2286924) (← links)
- A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints (Q2339816) (← links)
- A unified exact method for solving different classes of vehicle routing problems (Q2390996) (← links)
- Routing optimization with time windows under uncertainty (Q2414906) (← links)
- Exact approaches to the robust vehicle routing problem with time windows and multiple deliverymen (Q2664412) (← links)
- An adaptive iterated local search heuristic for the heterogeneous fleet vehicle routing problem (Q2676358) (← links)
- New state-space relaxations for solving the traveling salesman problem with time windows (Q2815450) (← links)
- A unified modeling and solution framework for vehicle routing and local search-based metaheuristics (Q2901011) (← links)
- An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem (Q2967616) (← links)
- Cutting planes for branch-and-price algorithms (Q3113514) (← links)
- Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem (Q3458834) (← links)
- (Q3751354) (← links)
- Robust Data-Driven Vehicle Routing with Time Windows (Q4994169) (← links)
- Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization (Q5086000) (← links)
- An Exact Solution Framework for Multitrip Vehicle-Routing Problems with Time Windows (Q5130490) (← links)
- Extensions of the Petal Method for Vehicle Routeing (Q5287233) (← links)
- Exact separation of the rounded capacity inequalities for the capacitated vehicle routing problem (Q6180050) (← links)
