Efficient solution methods for the integer programming models of relocating empty containers in the hinterland transportation network

Shintani et al. (2010) developed five integer programming models to analyze the effects of using foldable containers in hinterland transportation. They solved the models using a general purpose integer programming algorithm and mentioned that other powerful solution methods are needed to solve a large size model. In this paper, we develop analytical solutions for two of their models and show that a network flow algorithm solves another two models.