A polynomial-time algorithm for sailing speed optimization with containership resource sharing

This publication has 31 references indexed in Scilit:

• A Polynomial-Time Descent Method for Separable Convex Optimization Problems with Linear Constraints
  SIAM Journal on Optimization, 2016
• Bunkering decisions for a shipping liner in an uncertain environment with service contract
  European Journal of Operational Research, 2015
• The time constrained multi-commodity network flow problem and its application to liner shipping network design
  Transportation Research Part E: Logistics and Transportation Review, 2015
• Budgeting Fuel Consumption of Container Ship over Round-Trip Voyage through Robust Optimization
  Transportation Research Record: Journal of the Transportation Research Board, 2015
• A Lagrangian heuristic for determining the speed and bunkering port of a ship
  Journal of the Operational Research Society, 2014
• Analysis of an exact algorithm for the vessel speed optimization problem
  Networks, 2013
• Mathematical expressions for the transit time of merchandise through a liner shipping network
  Journal of the Operational Research Society, 2012
• An epsilon-optimal algorithm considering greenhouse gas emissions for the management of a ship’s bunker fuel
  Transportation Research Part D: Transport and Environment, 2012
• Berth allocation considering fuel consumption and vessel emissions
  Transportation Research Part E: Logistics and Transportation Review, 2011
• Is slow steaming a sustainable means of reducing CO2 emissions from container shipping?
  Transportation Research Part D: Transport and Environment, 2011