New Lower Bound and Exact Method for the Continuous Berth Allocation Problem

DOI10.1287/opre.2017.1687zbMath1443.90197OpenAlexW2792687368MaRDI QIDQ4971379

Chung-Yee Lee, Zhou Xu

Publication date: 12 October 2020

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.2017.1687

zbMATH Keywords

branch and boundlower boundexact methodcontinuous berth allocation

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items (4)

Berth allocation and quay crane assignment/scheduling problem under uncertainty: a survey ⋮ Pilotage planning in seaports ⋮ Vessel Service Planning in Seaports ⋮ Exact solution techniques for two-dimensional cutting and packing

Cites Work

• Unnamed Item
• A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
• Tactical berth allocation under uncertainty
• Multi-objective and prioritized berth allocation in container ports
• A survey of berth allocation and quay crane scheduling problems in container terminals
• The berth allocation problem: models and solution methods
• A review of the application of meta-heuristic algorithms to 2D strip packing problems
• An adaptive large neighborhood search for the discrete and continuous berth allocation problem
• Two-dimensional packing problems: a survey
• A scheduling method for Berth and Quay cranes
• Berth management in container terminal: the template design problem
• Exact Solution of the Two-Dimensional Finite Bin Packing Problem
• Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
• Combinatorial Benders' Cuts for the Strip Packing Problem
• Berth Allocation Planning Optimization in Container Terminals
• An Exact Algorithm for the Two-Dimensional Strip-Packing Problem
• The Three-Dimensional Bin Packing Problem
• Berth scheduling for container terminals by using a sub-gradient optimization technique
• A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
• Scheduling

This page was built for publication: New Lower Bound and Exact Method for the Continuous Berth Allocation Problem