Pages that link to "Item:Q2108132"
From MaRDI portal
The following pages link to A unified exact approach for clustered and generalized vehicle routing problems (Q2108132):
Displaying 14 items.
- Evaluating two new heuristics for constructing customer clusters in a VRPTW with multiple service workers (Q301906) (← links)
- An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size (Q336876) (← links)
- Hybrid metaheuristics for the clustered vehicle routing problem (Q337513) (← links)
- A remark on ``Integer linear programming formulation for a vehicle routing problem'' by N. R. Achutan and L. Caccetta, or how to use the Clark \(\&\) Wright savings to write such integer linear programming formulations (Q1333529) (← links)
- A fast two-level variable neighborhood search for the clustered vehicle routing problem (Q1652293) (← links)
- A transformation technique for the clustered generalized traveling salesman problem with applications to logistics (Q2183848) (← links)
- A branch-and-cut algorithm for the soft-clustered vehicle-routing problem (Q2208364) (← links)
- Exact solution of the soft-clustered vehicle-routing problem (Q2272311) (← links)
- New mathematical models of the generalized vehicle routing problem and extensions (Q2428862) (← links)
- The joint order batching and picker routing problem: modelled and solved as a clustered vehicle routing problem (Q2668601) (← links)
- (Q3838116) (← links)
- Exact and heuristic algorithms for solving the generalized vehicle routing problem with flexible fleet size (Q4979994) (← links)
- A decomposition-based method for solving the clustered vehicle routing problem (Q5384360) (← links)
- Budget-balanced and strategy-proof auctions for ridesharing (Q6109306) (← links)
