Combinatorial relaxation bounds and preprocessing for berth allocation problems

DOI10.1016/j.endm.2016.10.022zbMath1364.90287OpenAlexW2553317938MaRDI QIDQ510943

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

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

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

Cites Work

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

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