Pages that link to "Item:Q4530665"
From MaRDI portal
The following pages link to A Lower Bound for the Split Delivery Vehicle Routing Problem (Q4530665):
Displaying 36 items.
- Branch-and-cut algorithms for the split delivery vehicle routing problem (Q296858) (← links)
- An iterated local search heuristic for the split delivery vehicle routing problem (Q337288) (← links)
- A branch-price-and-cut method for a ship routing and scheduling problem with split loads (Q339703) (← links)
- A randomized granular tabu search heuristic for the split delivery vehicle routing problem (Q490211) (← links)
- An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems (Q841604) (← links)
- The vehicle routing problem with demand range (Q867541) (← links)
- An adaptive memory algorithm for the split delivery vehicle routing problem (Q972645) (← links)
- Improved lower bounds for the split delivery vehicle routing problem (Q991469) (← links)
- Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil (Q1042225) (← links)
- New exact solution approaches for the split delivery vehicle routing problem (Q1742903) (← links)
- Large scale stochastic inventory routing problems with~split delivery and service level constraints (Q1761929) (← links)
- A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups (Q1782165) (← links)
- A tabu search heuristic for the vehicle routing problem with time windows and split deliveries (Q1879783) (← links)
- Integer linear programming models for a cement delivery problem (Q1926974) (← links)
- Two-echelon vehicle routing problems: a literature review (Q2079391) (← links)
- Neural large neighborhood search for routing problems (Q2093389) (← links)
- Branch and price for the vehicle routing problem with discrete Split deliveries and time windows (Q2275800) (← links)
- The split delivery vehicle routing problem with three-dimensional loading constraints (Q2282545) (← links)
- A branch-and-cut algorithm for an assembly routing problem (Q2286876) (← links)
- An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem (Q2337401) (← links)
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
- New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP (Q2466786) (← links)
- A new model and hybrid approach for large scale inventory routing problems (Q2482782) (← links)
- A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems (Q2488912) (← links)
- A hybrid VND method for the split delivery vehicle routing problem (Q2631222) (← links)
- Simultaneously exploiting two formulations: an exact Benders decomposition approach (Q2664373) (← links)
- An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery (Q2669556) (← links)
- The split delivery capacitated team orienteering problem (Q2811321) (← links)
- A novel approach to solve the split delivery vehicle routing problem (Q2968484) (← links)
- The Split Delivery Vehicle Routing Problem: A Survey (Q3564351) (← links)
- Particle Swarm Optimization for Split Delivery Vehicle Routing Problem (Q4642133) (← links)
- Vehicle routing problems with split deliveries (Q4918250) (← links)
- A column generation approach for the split delivery vehicle routing problem (Q5894493) (← links)
- A column generation approach for the split delivery vehicle routing problem (Q5900196) (← links)
- A branch-and-cut embedded matheuristic for the inventory routing problem (Q6047912) (← links)
- The Vehicle Routing Problem with Stochastic Demands and Split Deliveries (Q6102745) (← links)