Pages that link to "Item:Q342059"
From MaRDI portal
The following pages link to A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem (Q342059):
Displaying 15 items.
- Branch-and-cut algorithms for the split delivery vehicle routing problem (Q296858) (← links)
- Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery (Q376001) (← links)
- A route decomposition approach for the single commodity split pickup and split delivery vehicle routing problem (Q2029263) (← links)
- Multi-compartment vehicle routing problems: state-of-the-art, modeling framework and future directions (Q2030448) (← links)
- Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes (Q2031089) (← links)
- A branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem (Q2242245) (← links)
- Branch and price for the vehicle routing problem with discrete Split deliveries and time windows (Q2275800) (← links)
- Adaptive large neighborhood search for the commodity constrained split delivery VRP (Q2329717) (← links)
- Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem (Q2424767) (← links)
- The commodity-split multi-compartment capacitated arc routing problem (Q2664322) (← links)
- Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order (Q2669495) (← links)
- Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows (Q3100458) (← links)
- A column‐generation‐based approach to fleet design problems mixing owned and hired vehicles (Q6067894) (← links)
- Vehicle routing problems with multiple commodities: a survey (Q6572828) (← links)
- A heuristic with a performance guarantee for the commodity constrained split delivery vehicle routing problem (Q6659085) (← links)
