Original scientific paper Location problems consider locating facilities with the objective of finding their best locations. In most real world problems, it is common that a demand node is required to be covered with multiple facilities in order to ensure a backup supply. The backup supply is necessary especially for public or emergency service location problems where a covered demand may not b...

we consider the queueing maximal covering location-allocation problem (qm-clap) with an m/m/1 queueing system. we propose a new solution procedure based on decomposition of the problem into smaller sub-problems. we solve the resulting sub-problems both with a branch and bound algorithm and with the meta-heuristic grasp. we also solve the entire model with grasp. computational results for these ...

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

We study a general class of non-cooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programming formulation. Each player wants to satisfy a subset of the constraints. Variables represent resources, which are available in costly integer units and must be bought. The cost can be shared arbitrarily between players. Once a...

This paper addresses a version of the single-facility Maximal Covering Location Problem on network where demand is: (i) distributed along edges and (ii) uncertain with only known interval estimation. To deal this problem, we propose minmax regret model service facility can be located anywhere network. problem is called Minmax Regret (MMR-EMCLP). Furthermore, present two polynomial algorithms fo...