Improving the location of minisum facilities through network modification
In this paper, we consider the problem of how the transportation network can be modified
most efficiently in order to improve the known location of the facilities. The performance of
the facilities is measured by the “minisum” objective. We examine in the paper two types of
network modifications: reductions and additions of links. We analyze various reduction and
addition problems for both trees and general networks. For trees, we present exact results
and algorithms for the majority of problems studied. For general networks, we discuss mainly …
most efficiently in order to improve the known location of the facilities. The performance of
the facilities is measured by the “minisum” objective. We examine in the paper two types of
network modifications: reductions and additions of links. We analyze various reduction and
addition problems for both trees and general networks. For trees, we present exact results
and algorithms for the majority of problems studied. For general networks, we discuss mainly …
Abstract
In this paper, we consider the problem of how the transportation network can be modified most efficiently in order to improve the known location of the facilities. The performance of the facilities is measured by the “minisum” objective. We examine in the paper two types of network modifications: reductions and additions of links. We analyze various reduction and addition problems for both trees and general networks. For trees, we present exact results and algorithms for the majority of problems studied. For general networks, we discuss mainly heuristics.
Springer