Pages that link to "Item:Q3100458"
From MaRDI portal
The following pages link to Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows (Q3100458):
Displaying 13 items.
- A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants (Q4995082) (← links)
- Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route (Q5326796) (← 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)
- A multi‐vehicle covering tour problem with speed optimization (Q6065856) (← links)
- An exact solution method for home health care scheduling with synchronized services (Q6077479) (← links)
- The Maritime Pickup and Delivery Problem with Time Windows and Split Loads (Q6102720) (← links)
- A branch‐and‐price‐and‐cut algorithm for the truck‐drone routing problem with simultaneously delivery and pickup (Q6150242) (← links)
- A two‐stage method for the shipper lane selection problem with time windows in transportation service procurement (Q6195025) (← links)
- Nested column generation for split pickup vehicle routing problem with time windows and time-dependent demand (Q6551134) (← links)
- A heuristic with a performance guarantee for the commodity constrained split delivery vehicle routing problem (Q6659085) (← links)
- Partial dominance in branch-price-and-cut algorithms for vehicle routing and scheduling problems with a single-segment tradeoff (Q6667800) (← links)
