Paving and computing the set of nondominated points for the bi-objective 0/1 uncapacitated facility location problem
The paper presents a three-phase algorithm to compute the set of nondominated points for the binary version of the uncapacitated facility location problem with two objectives. The first phase constructs a paving in objective space which is a collection of boxes that covers all nondominated points. The paving procedure is a branch and bound algorithm … Read more