The following pages link to Liner shipping network design (Q2184083):
Displayed 12 items.
- An adaptive large neighbourhood search heuristic for routing and scheduling feeder vessels in multi-terminal ports (Q2023947) (← links)
- Container liner shipping network design with shipper's dual preference (Q2027078) (← links)
- A branch-and-price algorithm for solving the single-hub feeder network design problem (Q2116907) (← links)
- Liner shipping network design (Q2184083) (← links)
- A branch-and-price algorithm for the liner shipping network design problem (Q2226484) (← links)
- Constraint programming and local search heuristic: a matheuristic approach for routing and scheduling feeder vessels in multi-terminal ports (Q2226489) (← links)
- The transit time constrained fixed charge multi-commodity network design problem (Q2669603) (← links)
- A MIP-based heuristic for a single trade routing and scheduling problem in roll-on roll-off shipping (Q2676312) (← links)
- Distributionally Robust Joint Chance Constrained Vessel Fleet Deployment Problem (Q5888376) (← links)
- Mathematical formulations for multi-period network design with modular capacity adjustments (Q6063580) (← links)
- Solving a maritime inventory routing problem under uncertainty using optimization and simulation (Q6088797) (← links)
- Uncertainty in maritime ship routing and scheduling: a literature review (Q6112538) (← links)