LetG=(U,V,E) be a bipartite graph with weights of its edgesc <Subscript> ij </Subscript>. For the assignment and transportation problem given by such a graph we propose efficient procedures for partitioning the edge setE into three classes:E <Subscript>o</Subscript> is the set of edgesij withx <Subscript> ij </Subscript>=0 for each optimum solution (0-persistent...</subscript></subscript></subscript>

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...

In recent years, there has been a proliferation of database systems in all types of organizations. In many cases, these databases are developed in different departments and maintained autonomously. Much is to be gained, however, if databases across departments, divisions, or even organizations...