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...

hub covering location problem, network design,   single machine scheduling, genetic algorithm,   shuffled frog leaping algorithm   hub location problems (hlp) are synthetic optimization problems that appears in telecommunication and transportation networks where nodes send and receive commodities (i.e., data transmissions, passengers transportation, express packages, postal deliveries, etc.) th...

Suppose S is a surface of genus ≥ 2, f : S → S is a surface homeomorphism isotopic to a pseudo-Anosov map α and suppose S̃ is the universal cover of S and F and A are lifts of f and α respectively. A result of A. Fathi shows there is a semiconjugacy Θ : S̃ → L̄ × L̄ from F to Ā, where L̄ (L̄) is the completion of the R-tree of leaves of the stable (resp. unstable) foliation for A and Ā is the map ind...

In this paper, we study the Generalized Bin Covering problem. For this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. To nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. By computational experiments, the eciency of the heuristic algorithm is assessed.

The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP. This solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. The algorithm parameters are tuned by design of experiments approach. The proposed method is te...