Abstract
Consider a finite setE, a weight functionw:E→R, and two matroidsM 1 andM 2 defined onE. The weighted matroid intersection problem consists of finding a setI⊆E, independent in both matroids, that maximizes Σ{w(e):e inI}. We present an algorithm of complexity O(nr(r+c+logn)) for this problem, wheren=|E|,r=min(rank(M 1), rank (M 2)),c=max (c 1,c 2) and, fori=1,2,c i is the complexity of finding the circuit ofI∪{e} inM i (or show that none exists) wheree is inE andI⊆E is independent inM 1 andM 2. A related problem is to find a maximum weight set, independent in both matroids, and of given cardinalityk (if one exists). Our algorithm also solves this problem. In addition, we present a second algorithm that, given a feasible solution of cardinalityk, finds an optimal one of the same cardinality. A sensitivity analysis on the weights is easy to perform using this approach. Our two algorithms are related to existing algorithms. In fact, our framework provides new simple proofs of their validity. Other contributions of this paper are the existence of nonnegative reduced weights (Theorem 6), allowing the improved complexity bound, and the introduction of artificial elements, allowing an improved start and flexibility in the implementation of the algorithms.
Similar content being viewed by others
References
C. Brezovec, G. Cornuéjols and F. Glover, “Generalized alternating cycles, shortest paths, and irreducible trees,” forthcoming paper.
J. Edmonds, “Submodular functions, matroids and certain polyhedra,” in: R. Guy, ed.,Combinatorial Structures and their Applications, Proceedings of the Calgary International Conference (Gordon and Breach, New York, 1970) pp. 69–87.
J. Edmonds, “Matroid intersection”,Annals of Discrete Mathematics 4 (1979) 39–49.
A. Frank, “A weighted matroid intersection algorithm”,Journal of Algorithms 2 (1981) 328–336.
M.L. Fredman and R.E. Tarjan, “Fibronacci heaps and their uses in improved network optimization algorithms”,Proceedings of the 25th Annual IEEE Symposium on the Foundations of Computer Science (1984) 338–346.
S. Fujishige, “A primal approach to the independent assignment problem”,Journal of the Operations Research Society of Japan 20 (1977) 1–15.
F. Glover, “The generalized quasi-greedy algorithm for constrained minimum weight matroid bases”, MSIS Series, Report No. 85-1, Graduate School of Business University of Colorado (Boulder, 1985).
M. Iri and N. Tomizawa, “An algorithm for finding an optimal independent assignment”,Journal of the Operations Research Society of Japan 19 (1976) 32–57.
E.L. Lawler,Combinatorial Optimization: Networks and Matroids (Holt, Rinehart and Winston, New York, 1976).
J.B. Orlin and J. Vande Vate, “On a ‘primal’ matroid intersection algorithm”, Sloan School Technical Report, MIT (Cambridge, 1984).
Author information
Authors and Affiliations
Additional information
This research was supported in part by NSF grant ECS 8503192 to Carnegie-Mellon University.
Rights and permissions
About this article
Cite this article
Brezovec, C., Cornuéjols, G. & Glover, F. Two algorithms for weighted matroid intersection. Mathematical Programming 36, 39–53 (1986). https://doi.org/10.1007/BF02591988
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02591988