A fast exact algorithm for the allocation of seats for the EU Parliament
The problem of the allocation of seats for the EU Parliament is considered. A fast exact algorithm is constructed that finds all feasible solutions. An extensive analysis of allocations and of the algorithm is presented.
allocation of seats elections degressive proportionality branch and bound