Pages that link to "Item:Q1761142"
From MaRDI portal
The following pages link to The traveling salesman problem with draft limits (Q1761142):
Displaying 12 items.
- A two-stage solution method for the annual dairy transportation problem (Q322617) (← links)
- A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping (Q1652016) (← links)
- A two-phase heuristic for an in-port ship routing problem with tank allocation (Q1652535) (← links)
- 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)
- A traveling salesman problem with pickups and deliveries and stochastic travel times: an application from chemical shipping (Q1749489) (← links)
- Optimizing ship speed to minimize total fuel consumption with multiple time windows (Q1792942) (← links)
- The heterogeneous fleet vehicle routing problem with draft limits (Q2108117) (← links)
- Cargo routing and scheduling problem in deep-sea transportation: case study from a fertilizer company (Q2177829) (← links)
- Exact algorithms for the traveling salesman problem with draft limits (Q2256207) (← links)
- CP methods for scheduling and routing with~time-dependent task costs (Q2513747) (← links)
- Tight lower bounds for the traveling salesman problem with draft limits (Q6109566) (← links)
