On the reformulation of vehicle routing problems and scheduling problems
From MaRDI portal
(Redirected from On the reformulation of vehicle routing problems and scheduling problems)
Recommendations
Cited in
(10)- 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
- The vehicle routing-allocation problem: A unifying framework
- An efficient transformation of the generalized vehicle routing problem
- A genetic column generation algorithm for sustainable spare part delivery: application to the Sydney droppoint network
- Bidirectional labeling for solving vehicle routing and truck driver scheduling problems
- Variants and formulations of the vehicle routing problem
- A branch-and-price-and-check model for the vehicle routing problem with location congestion
- Graph transformations for the vehicle routing and job shop scheduling problems
- Reformulating linear programs with transportation constraints-With applications to workforce scheduling
- A case study of mutual routing-scheduling reformulation
This page was built for publication: On the reformulation of vehicle routing problems and scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737601)