Fundamental properties and pseudo-polynomial-time algorithm for network containership sailing speed optimization
DOI10.1016/j.ejor.2015.10.052zbMath1346.90189OpenAlexW1853259359MaRDI QIDQ322396
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2015.10.052
Abstract computational complexity for mathematical programming problems (90C60) Nonlinear programming (90C30) Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items (7)
Uses Software
Cites Work
- Unnamed Item
- Distribution-free vessel deployment for liner shipping
- The vessel schedule recovery problem (VSRP) -- a MIP model for handling disruptions in liner shipping
- Methods for strategic liner shipping network design
- A service flow model for the liner shipping network design problem
- Ship routing and scheduling in the new millennium
- Impact analysis of maritime cabotage legislations on liner hub-and-spoke shipping network design
- Analysis of an exact algorithm for the vessel speed optimization problem
- Reducing fuel emissions by optimizing speed on shipping routes
- Searching for the Multiplier in One-Constraint Optimization Problems
- Liner Shipping Cargo Allocation with Repositioning of Empty Containers
This page was built for publication: Fundamental properties and pseudo-polynomial-time algorithm for network containership sailing speed optimization