Skip to main navigation
Skip to search
Skip to main content
PolyU Scholars Hub Home
Help & FAQ
Home
Researchers
Units
Research output
Prizes
Activities
Press/Media
Student theses
Search by expertise, name or affiliation
Fundamental properties and pseudo-polynomial-time algorithm for network containership sailing speed optimization
Shuaian Wang
Department of Logistics and Maritime Studies
The Hong Kong Polytechnic University
Research output
:
Journal article publication
›
Journal article
›
Academic research
›
peer-review
33
Citations (Scopus)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Fundamental properties and pseudo-polynomial-time algorithm for network containership sailing speed optimization'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Pseudo-polynomial Time Algorithm
100%
Container Ship
100%
Sailing Speed Optimization
100%
Analytical Solution
60%
Sailing Speed
60%
Optimality Conditions
40%
Ship Routes
40%
Bunker Consumption
40%
Pseudo-polynomial Time
20%
Solution Algorithm
20%
Search Methods
20%
Polynomial Time Solution
20%
Transit Time
20%
Inventory Cost
20%
Total Operating Cost
20%
Managerial Insights
20%
Shipping Capacity
20%
Liner Shipping Network
20%
Shipping Network
20%
Bunker Cost
20%
Container Liner Shipping
20%
Integer numbers
20%
ε-Optimal
20%
Cost Consumption
20%
Container Shipping Companies
20%
Engineering
Polynomial Time
100%
Optimality
100%
Solution Algorithm
50%
Search Method
50%
Shipping Container
50%
Integer Number
50%
Operating Cost
50%