Abstract
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 edges);E 1 is the set of edges withx ij > 0 and constant for each optimum (1-persistent edges) andE w is the set of edges such that there are two optimum solutions x, x′ withx ij ≠x ij 1 (weakly persistent edges).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aho AV, Hopcroft JE, Ullman JD (1974) The design and analysis of computer algorithms. Addison-Wesley, Reading, MA
Costa M-C (1994) Persistency in maximum cardinality bipartite matchings. Operations Research Letters 15:143–149
Lovász L, Plummer MN (1986) Matching theory. Akadémiai Kiadó, Budapest
Naddef DJ (1982) Rank of maximum matchings in a graph. Math. Programming 22:52–70
Papadimitriou CH, Steiglitz K (1982) Combinatorial optimization: Algorithms and complexity. Prentice-Hall, New Jersey
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Cechlárová, K. Persistency in the assignment and transportation problems. Mathematical Methods of Operations Research 47, 243–254 (1998). https://doi.org/10.1007/BF01194399
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01194399