Pages that link to "Item:Q2256207"
From MaRDI portal
The following pages link to Exact algorithms for the traveling salesman problem with draft limits (Q2256207):
Displaying 7 items.
- A general variable neighborhood search variants for the travelling salesman problem with draft limits (Q1677289) (← links)
- A branch-and-price approach to the feeder network design problem (Q1681514) (← links)
- The heterogeneous fleet vehicle routing problem with draft limits (Q2108117) (← links)
- Exact and heuristic algorithms for the parallel machine total completion time scheduling problem with dual resources, ready times, and sequence-dependent setup times (Q2147050) (← links)
- Cargo routing and scheduling problem in deep-sea transportation: case study from a fertilizer company (Q2177829) (← links)
- Theory and application of reciprocal transformation of “path problem” and “time float problem” (Q2969956) (← links)
- Tight lower bounds for the traveling salesman problem with draft limits (Q6109566) (← links)
