Although modern location theory is now more than 90 years old, the focus of researchers in this area has been mainly problem oriented. However, a common theory, which keeps the essential characteristics of classical location models, is still missing. This monograph addresses this issue. A...

We consider the problem of partitioning a graph into multiple components when the capacity of cut-edges is restricted. The objective function can be formulated in several ways. The different problems studied are: Maximizing Parallelism (MP), Most Uniform Partition (MUP) and also p-Most Uniform...

This paper deals with facility location problems in a continuous space with neighbours and barriers. Each one of these two elements, neighbours and barriers, make the problems harder than their standard counterparts. Therefore, mixing both together results in a new challenging problem that, as...

This paper deals with two different route design problems in a continuous space with neighbours and barriers: the shortest path and the travelling salesman problems with neighbours and barriers. Each one of these two elements, neighbours and barriers, makes the problems harder than their...