Pages that link to "Item:Q1991157"
From MaRDI portal
The following pages link to A branch-and-price algorithm for a vehicle routing with demand allocation problem (Q1991157):
Displayed 8 items.
- Efficient formulation for transportation scheduling of single refinery multiproduct pipelines (Q2030316) (← links)
- An exact algorithm for the redundancy allocation problem with heterogeneous components under the mixed redundancy strategy (Q2060427) (← links)
- A variable neighborhood search for the last-mile delivery problem during major infectious disease outbreak (Q2070131) (← links)
- Research on coordination and optimization of order allocation and delivery route planning in take-out system (Q2193400) (← links)
- Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order (Q2669495) (← links)
- A directional heuristics pulse algorithm for a two resources constrained shortest path problem with reinitialization (Q2691338) (← links)
- An exact solution method for home health care scheduling with synchronized services (Q6077479) (← links)
- Patient appointment scheduling at hemodialysis centers: an exact branch and price approach (Q6112733) (← links)