The berth allocation problem (BAP) involves decisions on how to allocate the berth space and to sequence maritime vessels that are to be loaded and unloaded at a container terminal involved in the maritime logistics. As the berth is a critical resource in a container terminal, an effective use of it is highly essential to have efficient berthing and servicing of vessels, and to optimize the associated costs. This study focuses on the minimum cost berth allocation problem (MCBAP) at a container terminal where the maritime vessels arrive dynamically. The objective comprises the waiting time penalty, tardiness penalty, handling cost and benefit of early service completion of vessels. This paper proposes three computationally efficient mixed integer linear programming (MILP) models for the MCBAP. Through numerical experiments, the proposed MILP models are compared to an existing model in the literature to evaluate their computational performance. The computational study with problem instances of various problem characteristics demonstrates the computational efficiency of the proposed models.Keywords. Maritime logistics; discrete berth allocation problem; minimum cost berth allocation problem; mixed integer linear programming models. Sådhanå (2019) 44:149 Ó Indian Academy of Sciences https://doi.org/10.1007/s12046-019-1128-7S adhana(0123456789().,-volV)FT3 ](0123456789().,-volV)