Valuated matroid intersection I: Optimality criteria

SIAM Journal on Discrete Mathematics

Volumn 9, Issue 4, 1996, Pages 545-561

  Murota, Kazuo ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

Combinatorial optimization; Independent assignment problem; Valuated matroid; Weighted matroid intersection problem

Indexed keywords

EID: 0000212947     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480195279994     Document Type: Article

References (36)

1. R. A. BRUALDI, Comments on bases in dependence structures, Bull. Austral. Math. Soc., 1 (1969), pp. 161-167.
2. A. W. M. DRESS AND W. TERHALLE, Well-layered maps and the maximum-degree k × k-subdeterminant of a matrix of rational functions, Appl. Math. Lett., 8 (1995), pp. 19-23.
3. _, Well-layered maps - A class of greedily optimizable set functions, Appl. Math. Lett., 8 (1995), pp. 77-80.
4. _, Rewarding maps - On greedy optimization of set functions, Adv. in Appl. Math., 16 (1995), pp. 464-483.
5. A. W. M. DRESS AND W. WENZEL, Valuated matroid: A new look at the greedy algorithm, Appl. Math. Lett., 3 (1990), pp. 33-35.
6. _, Valuated matroids, Adv. Math., 93 (1992), pp. 214-250.
7. J. EDMONDS, Submodular functions, matroids and certain polyhedra, in Combinatorial Structures and Their Applications, R. Guy, H. Hanai, N. Sauer, and J. Schonsheim, eds., Gordon and Breach, New York, 1970, pp. 69-87.
8. _, Matroid intersection, Ann. Discrete Math., 14 (1979), pp. 39-49.
9. U. FAIGLE, Matroids in combinatorial optimization, in Combinatorial Geometries, N. White, ed., Cambridge University Press, London, 1987, pp. 161-210.
10. A. FRANK, A weighted matroid intersection algorithm, J. Algorithms, 2 (1981), pp. 328-336.
11. _, An algorithm for submodular functions on graphs, Ann. Discrete Math., 16 (1982), pp. 97-120.
12. S. FUJISHIGE, A primal approach to the independent assignment problem, J. Oper. Res. Soc. Japan, 20 (1977), pp. 1-15.
13. S. FUJISHIGE, An algorithm for finding an optimal independent linkage, J. Oper. Res. Soc. Japan, 20 (1977), pp. 59-75.
14. _, Submodular Functions and Optimization, Ann. Discrete Math. 47, North-Holland, Amsterdam, 1991.
15. M. IRI, A practical algorithm for the Menger-type generalization of the independent assignment problem, Math. Prog. Study, 8 (1978), pp. 88-105.
16. _, Applications of matroid theory, in Mathematical Programming - The State of the Art, A. Bachem, M. Grötschel, and B. Korte, eds., Springer-Verlag, Berlin, 1983, pp. 158-201.
17. M. IRI AND N. TOMIZAWA, An algorithm for finding an optimal "independent assignment", J. Oper. Res. Soc. Japan, 19 (1976), pp. 32-57.
18. S. KROGDAHL, The dependence graph for bases in matroids, Discrete Math., 19 (1977), pp. 47-59.
19. J. P. S. KUNG, Basis-exchange properties, in Theory of Matroids, N. White, ed., Cambridge University Press, London, 1986, pp. 62-75.
20. E. L. LAWLER, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York, 1976.
21. L. LOVASZ AND M. PLUMMER, Matching Theory, North-Holland, Amsterdam, 1986.
22. K. MUROTA, Systems Analysis By Graphs and Matroids - Structural Solvability and Controllability, Algorithms and Combinatorics 3, Springer-Verlag, Berlin, 1987.
23. _, Combinatorial relaxation algorithm for the maximum degree of subdeterminants: Computing Smith-McMillan form at infinity and structural indices in Kronecker form, Applicable Algebra in Engineering, Communication and Computing, 6 (1995), pp. 251-273.
24. _, Finding optimal minors of valuated bimatroids, Appl. Math. Lett., 8 (1995), pp. 37-42.
25. _, Valuated matroid intersection II: Algorithms, SIAM J. Discrete Matn., 9 (1996), pp. 562-576.
26. _, Fenchel-type Duality for Matroid Valuations, Report 95839-OR, Forschungsinstitut für Diskrete Mathematik, Universität Bonn, Germany, 1995.
27. _, Submodular Flow Problem with a Nonseparable Cost Function, Report 95843-OR, Forschungsinstitut für Diskrete Mathematik, Universität Bonn, Germany, 1995.
28. _, Convexity and Steinitz's exchange property, Adv. Appl. Math., to appear. Extended abstract in the Proceedings of Integer Programming and Combinatorial Optimization, V, June 1996, Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1996.
29. _, Structural approach in systems analysis by mixed matrices - An exposition for index of DAE, in Proc. ICIAM 95, Hamburg, K. Kirchgassner, O. Mahrenholtz, and R. Mennicken, eds., Mathematical Research, Academie Verlag, Berlin, 1996.
30. A. RECSKI, Matroid Theory and Its Applications in Electric Network Theory and In Statics, Algorithms and Combinatorics 6, Springer-Verlag, Berlin, 1989.
31. H. H. ROSENBROCK, State-space and Multivariable Theory, Nelson, London, 1970.
32. A. SCHRIJVER, Matroids and linking systems, J. Combin. Theory Ser. B, 26 (1979), pp. 349-369.
33. W. TERHALLE, Ein kombinatorischer Zugang zu p-adischer Geometrie: Bewertete Matroide, Bäume und Gebäude, Doctor's dissertation, Universität Bielefeld, Germany, 1992.
34. M. VIDYASAGAR, Control System Synthesis: A Factorization Approach, MIT Press, Cambridge, MA, 1985.
35. U. ZIMMERMANN, Minimization on submodular flows, Discrete Appl. Math., 4 (1982), pp. 303-323.
36. _, Negative circuits for flows and submodular flows, Discrete Appl. Math., 36 (1992), pp. 179-189.