In the facility location problem usually reducing total transferring cost and time are common objectives. Designing of a network with hub facilities can improve network efficiency. In this study a new model is presented for P-hub covering location problem. In the p-hub covering problem it is attempted to locate hubs and allocate customers to established hubs while allocated nodes to hubs are in...

Planar Maximum Covering Location by Ellipses is an optimization problem where one wants to choose the location of ellipses given their major and minor axes cover demand points, maximizing a function depending on value covered points. We propose new exact algorithms for two versions this problem, have be parallel coordinate axes, another they can freely rotated. Besides finding optimal solutions...

This paper introduces a general modeling framework for multi-type maximal covering location problem in which the position of facilities different normed spaces are simultaneously decided to maximize demand generated by set points. From need intertwining decisions discrete and continuous sets, hybridized is considered some types be located finite sets others spaces. A natural non-linear model pr...