Abstract
We provide a new characterization for matroids which is useful for sensitivity analysis and for solving certain max min matroid optimization problems.
Zusammenfassung
Es wird eine neue Charakterisierung von Matroiden angegeben, welche für eine Sensitivitätsanalyse und für eine Lösung von Max-Min-Optimierungsproblemen für Matroide nützlich ist.
Similar content being viewed by others
References
Edmonds, J.: Matroids and the Greedy Algorithm. Mathematical Programming1, 1971, 127–136.
Granot, D., andI. Zang: On the Min-Max of Some Combinatorial Optimization Problems. Working Paper, Faculty of Commerce, U.B.C., Vancouver, May 1982.
Hausmann, D., andB. Korte: Algorithmic Versus Axiomatic Definitions of Matroids. Mathematical Programming Study14, 1981, 98–111.
Shapiro, J.F.: A Survey of Lagrangean Techniques for Discrete Optimization. In: Discrete Optimization II. Ed. by P.L. Hammer, E.L. Johnson, and B.H. Korte. Annals of Discrete Math.5, 1977, 113–138.
Welsh, D.J.A.: Matroid Theory. New York 1976.
Author information
Authors and Affiliations
Additional information
Research was partially supported by National Science and Engineering Research Council of Canada Grant A4181.
Rights and permissions
About this article
Cite this article
Granot, D. A new exchange property for matroids and its application to max-min-problems. Zeitschrift für Operations Research 28, 41–45 (1984). https://doi.org/10.1007/BF01919086
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01919086