We deal with the problem of assigning seats to the European Parliament within the special requirements imposed by the rules of the EU. Since the usual rounding techniques, like in the divisor methods, may fail to satisfy these requirements, we propose to use integer linear programming (ILP) to...

In this paper we investigate the problem of selecting a committee consisting of k members from a list of m candidates. Each candidate has a certain cost or weight. The choice of the k-committee has to satisfy some budget or weight constraint: the sum of the weights of all committee members must...

This paper analyzes the computational complexity involved in solving fairness issues on graphs, e.g., in the installation of networks such as water networks or oil pipelines. Based on individual rankings of the edges of a graph, we will show under which conditions solutions, i.e., spanning...

A fair spanning tree of a graph maximizes the minimum satisfaction among individuals given their preferences over the edges of the graph. In this note we answer an open question about the computational complexity of determining fair spanning trees raised in Darmann et al. (2009). It is shown...