Cechlárová, Katarina - In: Computational Statistics 47 (1998) 2, pp. 243-254
LetG=(U,V,E) be a bipartite graph with weights of its edgesc ij . For the assignment and transportation problem given by such a graph we propose efficient procedures for partitioning the edge setE into three classes:E o is the set of edgesij withx ij =0 for each optimum solution (0-persistent...