Ship Scheduling with Recurring Visits and Visit Separation Requirements
From MaRDI portal
Publication:5493633
DOI10.1007/0-387-25486-2_8zbMath1246.90065OpenAlexW2219672471MaRDI QIDQ5493633
Bjørn Nygreen, Nina Linn Ulstein, David M. Ryan, Mikkel M. Sigurd
Publication date: 16 October 2006
Published in: Column Generation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/0-387-25486-2_8
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (6)
Tramp ship routing and scheduling with voyage separation requirements ⋮ Classification of Ship Routing and Scheduling Problems in Liner Shipping ⋮ A survey on maritime fleet size and mix problems ⋮ Industrial aspects and literature survey: fleet composition and routing ⋮ Industrial and tramp ship routing problems: closing the gap for real-scale instances ⋮ Ship routing and scheduling in the new millennium
This page was built for publication: Ship Scheduling with Recurring Visits and Visit Separation Requirements
