Pages that link to "Item:Q3356060"
From MaRDI portal
The following pages link to Routing Container Ships Using Lagrangean Relaxation and Decomposition (Q3356060):
Displaying 16 items.
- Single string planning problem arising in liner shipping industries: a heuristic approach (Q336521) (← links)
- Liner shipping network design with deadlines (Q336778) (← links)
- Model and algorithms for multi-period sea cargo mix problem (Q872163) (← links)
- Ship scheduling: The last decade (Q1319526) (← links)
- Vessel capacity restrictions in the fleet deployment problem: an application to the Panama Canal (Q1695783) (← links)
- Large-scale optimization planning methods for the distribution of United States army munitions (Q1767085) (← links)
- Short-term liner ship fleet planning with container transshipment and uncertain container shipment demand (Q1926991) (← links)
- Optimizing voyage charterparty (VCP) arrangement: laytime negotiation and operations coordination (Q2029971) (← links)
- Speed optimizations for liner networks with business constraints (Q2184075) (← links)
- Ship routing using genetic algorithms (Q2241313) (← links)
- Methods for strategic liner shipping network design (Q2256277) (← links)
- Modeling and Managing Uncertainty in Process Planning and Scheduling (Q3638500) (← links)
- Collaboration in Cargo Transportation (Q3638512) (← links)
- Optimization in liner shipping (Q5892394) (← links)
- Optimization in liner shipping (Q5915966) (← links)
- Classification of Ship Routing and Scheduling Problems in Liner Shipping (Q6102728) (← links)
