The clustering problem, in its many variants, has numerous applications operations research and computer science (e.g., bioinformatics, image processing, social network analysis, etc.). As sizes of data sets have grown rapidly, researchers focused on designing algorithms for problems models computation suited large-scale such as MapReduce, Pregel, streaming models. k-machine model (Klauck et al...

We present a branch-and-cut algorithm to solve the single commodity uncapacitated fixed charge network flow problem, which includes the Steiner tree problem, uncapacitated lot-sizing problems, and the fixed charge transportation problem as special cases. The cuts used are simple dicut inequalities and their variants. A crucial problem when separating these inequalities is to find the right cut ...

This paper studies the robust optimization for the single allocation p-hub median problem under discount factor uncertainty. We develop the discount factor as a novel uncertain parameter, which represents different connection modes between hubs. The discount factor can be described by a random variable with discrete distribution in nominal case. We apply a robust optimization approach to deal w...

This paper addresses the berth allocation problem in a multi-user container terminal. There are two typical schemes for berth allocation: one in discrete locations and the other in continuous locations. The former has the advantage of easiness in scheduling but it has a weakness in that terminal usage is not fully efficient. The latter exhibits the complete opposite characteristics. In previous...

Centralizing and using proper transportation facilities cut down costs and traffic. Hub facilities concentrate on flows to cause economic advantage of scale and multimodal transportation helps use the advantage of another transporter. A distinctive feature of this paper is proposing a new mathematical formulation for a three-stage p-hub location routing problem with simultaneous pick-ups and de...

Hub location-allocation problems are currently a subject of keen interest in the research community. However, when this issue is considered in practice, significant difficulties such as traffic, commodity transportation and telecommunication tend to be overlooked. In this paper, a novel robust mathematical model for a p-hub covering problem, which tackles the intrinsic uncertainty of some param...