Approximate dynamic programming for liner shipping network design

DOI10.1007/S10479-024-06106-1MaRDI QIDQ7349799zbMATH OpenFDO

Authors Sangmin Lee, Trine Krogh Boomsma, Klaus Kähler Holst

Publication date 17 September 2026

Published in Annals of Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10479-024-06106-1

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• Approximate dynamic programming. Solving the curses of dimensionality
• Container liner shipping network design with shipper's dual preference
• Container shipping service selection and cargo routing with transshipment limits
• Deep learning
• Deep reinforcement learning for inventory control: a roadmap
• Dynamic programming and stochastic control processes
• Dynamic-programming approximations for stochastic time-staged integer multicommodity-flow problems
• scientific article; zbMATH DE number 3128787 (Why is no real title available?)
• Liner shipping network design
• Liner shipping network design with deadlines
• Reference policies for non-myopic sequential network design and timing problems
• Reinforcement learning for combinatorial optimization: a survey
• Reinforcement learning. An introduction
• Robust Estimation of a Location Parameter
• Simple statistical gradient-following algorithms for connectionist reinforcement learning
• Single liner shipping service design
• Speed optimization and bunkering in liner shipping in the presence of uncertain service times and time windows at ports

This page was built for publication: Approximate dynamic programming for liner shipping network design

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7349799)