Pages that link to "Item:Q1651704"
From MaRDI portal
The following pages link to Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems (Q1651704):
Displaying 24 items.
- A hybrid algorithm for a class of vehicle routing problems (Q336559) (← 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 column generation approach to the heterogeneous fleet vehicle routing problem (Q868147) (← links)
- Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems (Q1694814) (← links)
- An exact solution method for a rich helicopter flight scheduling problem arising in offshore oil and gas logistics (Q2027044) (← links)
- Solving bin packing problems using VRPSolver models (Q2033390) (← links)
- Efficient approximation of the metric CVRP in spaces of fixed doubling dimension (Q2046271) (← links)
- Approximation of the capacitated vehicle routing problem with a limited number of routes in metric spaces of fixed doubling dimension (Q2048811) (← links)
- Consistent vehicle routing with pickup decisions -- insights from sport academy training transfers (Q2076943) (← links)
- A concise guide to existing and emerging vehicle routing problem variants (Q2184128) (← links)
- A generic exact solver for vehicle routing and related problems (Q2196312) (← links)
- A unified exact method for solving different classes of vehicle routing problems (Q2390996) (← 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)
- MineReduce: an approach based on data mining for problem size reduction (Q2664324) (← links)
- Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order (Q2669495) (← links)
- A POPMUSIC matheuristic for the capacitated vehicle routing problem (Q2669570) (← links)
- Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments (Q2811328) (← links)
- A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem (Q3057116) (← links)
- Robust Optimization of a Broad Class of Heterogeneous Vehicle Routing Problems Under Demand Uncertainty (Q3386790) (← links)
- Incorporating the pricing decisions into the dynamic fleet management problem (Q5447770) (← links)
- Metaheuristics with variable diversity control and neighborhood search for the heterogeneous site-dependent multi-depot multi-trip periodic vehicle routing problem (Q6164388) (← links)
- The workforce scheduling and routing problem with park-and-loop (Q6663965) (← links)
