Pages that link to "Item:Q296858"
From MaRDI portal
The following pages link to Branch-and-cut algorithms for the split delivery vehicle routing problem (Q296858):
Displayed 21 items.
- Exactly solving packing problems with fragmentation (Q342536) (← links)
- Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem (Q1652698) (← links)
- New exact solution approaches for the split delivery vehicle routing problem (Q1742903) (← links)
- A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups (Q1782165) (← links)
- Bin packing problem with conflicts and item fragmentation (Q2026980) (← links)
- Two-echelon vehicle routing problems: a literature review (Q2079391) (← links)
- The multiphase course timetabling problem (Q2116932) (← links)
- A concise guide to existing and emerging vehicle routing problem variants (Q2184128) (← links)
- A column generation-based heuristic for the split delivery vehicle routing problem with time windows (Q2226483) (← links)
- A branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem (Q2242245) (← links)
- A multi-compartment vehicle routing problem in cold-chain distribution (Q2273654) (← links)
- The split delivery vehicle routing problem with three-dimensional loading constraints (Q2282545) (← links)
- Classification, models and exact algorithms for multi-compartment delivery problems (Q2630232) (← 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)
- Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem (Q2672134) (← links)
- A MILP model and two heuristics for the bin packing problem with conflicts and item fragmentation (Q2673554) (← links)
- Particle Swarm Optimization for Split Delivery Vehicle Routing Problem (Q4642133) (← links)
- A branch-and-cut embedded matheuristic for the inventory routing problem (Q6047912) (← links)
- Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem (Q6085887) (← links)
- The travelling salesman problem with positional consistency constraints: an application to healthcare services (Q6167660) (← links)