Combinatorial relaxation bounds and preprocessing for berth allocation problems

DOI10.1016/J.ENDM.2016.10.022MaRDI QIDQ510943zbMATH OpenOpenAlexFDO

Authors Evellyn Cavalcante, Johan Oppen, Phillippe Samer, Sebastián Urrutia

Publication date 14 February 2017

Full work available at URL https://doi.org/10.1016/j.endm.2016.10.022

zbMATH Keywords

matchingmaritime logisticsport operationsdual boundsprobing

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)

Recommendations

• Combinatorial approach to exactly solving discrete and hybrid berth allocation problem
• New lower bound and exact method for the continuous berth allocation problem
• The berth allocation problem: models and solution methods
• On the berth allocation problem
• The berth allocation problem with a cut-and-run option
• The dynamic berth allocation problem: A linearized formulation
• The berth allocation problem in terminals with irregular layouts
• A set-partitioning-based model for the berth allocation problem under time-dependent limitations
• A dynamic programming-based matheuristic for the dynamic berth allocation problem

Cites work

• Optimal berth allocation and time-invariant quay crane assignment in container terminals

Cited in

(3)

• New lower bound and exact method for the continuous berth allocation problem
• Combinatorial approach to exactly solving discrete and hybrid berth allocation problem
• The matching relaxation for a class of generalized set partitioning problems

This page was built for publication: Combinatorial relaxation bounds and preprocessing for berth allocation problems

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