Valuated matroid intersection II: Algorithms

SIAM Journal on Discrete Mathematics

Volumn 9, Issue 4, 1996, Pages 562-576

  Murota, Kazuo ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

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

Indexed keywords

EID: 0000605654     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480195280009     Document Type: Article

References (28)

1. W. COOK, W. H. CUNNINGHAM, W. R. PULLEYBLANK, AND A. SCHRIJVER, Combinatorial Optimization, to appear.
2. W. CUI AND S. FUJISHIGE, A primal algorithm for the submodular flow problem with minimum-mean cycle selection, J. Oper. Res. Soc. Japan, 31 (1988), pp. 431-440.
3. W. H. CUNNINGHAM AND A. FRANK, A primal-dual algorithm for submodular flows, Math. Oper. Res., 10 (1985), pp. 251-262.
4. A. W. M. DRESS AND W. WENZEL, Valuated matroid: A new look at the greedy algorithm, Appl. Math. Lett., 3 (1990), pp. 33-35.
5. _, Valuated matroids, Adv. Math., 93 (1992), pp. 214-250.
6. J. EDMONDS AND R. M. KARP, Theoretical improvements in algorithmic efficiency for network flow problems, J. Assoc. Comput. Mach., 19 (1972), pp. 248-264.
7. A. FRANK, A weighted matroid intersection algorithm, J. Algorithms, 2 (1981), pp. 328-336.
8. _, An algorithm for submodular functions on graphs, Ann. Discrete Math., 16 (1982), pp. 97-120.
9. S. FUJISHIGE, A primal approach to the independent assignment problem, J. Oper. Res. Soc. Japan, 20 (1977), pp. 1-15.
10. _, An algorithm for finding an optimal independent linkage, J. Oper. Res. Soc. Japan, 20 (1977), pp. 59-75.
11. _, Algorithms for solving the independent-flow problems, J. Oper. Res. Soc. Japan, 21 (1978), pp. 189-204.
12. _, Submodular Functions and Optimization, Annals of Discrete Mathematics 47, North-Holland, Amsterdam, 1991.
13. A. V. GOLDBERG AND R. E. TARJAN, Finding minimum-cost circulations by canceling negative cycles, J. Assoc. Comput. Mach., 36 (1989), pp. 873-886.
14. M. IRI, A practical algorithm for the Menger-type generalization of the independent assignment problem, Mathematical Programming Study, 8 (1978), pp. 88-105.
15. M. IRI AND N. TOMIZAWA, An algorithm for finding an optimal "independent assignment", J. Oper. Res. Soc. Japan, 19 (1976), pp. 32-57.
16. R. M. KARP, A characterization of the minimum mean cycle in a digraph, Discrete Math., 23 (1978), pp. 309-311.
17. M. KLEIN, A primal method for minimal cost flows, Management Science, 14 (1967), pp. 205-220.
18. E. L. LAWLER, Matroid intersection algorithms, Math. Prog., 9 (1975), pp. 31-56.
19. _, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York, 1976.
20. L. LOVÁSZ AND M. PLUMMER, Matching Theory, North-Holland, Amsterdam, 1986.
21. S. T. MCCORMICK, Approximate binary search algorithms for mean cuts and cycles, Oper. Res. Lett., 14 (1993), pp. 129-132.
22. N. MEGIDDO, Combinatorial optimization with rational objective functions, Math. Oper. Res., 4 (1979), pp. 414-424.
23. K. MUROTA, Computing the degree of determinants via combinatorial relaxation, SIAM J. Comput., 24 (1995), pp. 765-796.
24. _, Valuated matroid intersection I: Optimality criteria, SIAM J. Discrete Math., 9 (1996), pp. 545-561.
25. J. B. ORLIN AND R. K. AHUJA, New scaling algorithms for the assignment and minimum cycle mean problems, Math. Prog., 54 (1992), pp. 41-56.
26. N. TOMIZAWA, On some techniques useful for solution of transportation network problems, Networks, 1 (1971), pp. 173-194.
27. U. ZIMMERMANN, Minimization on submodular flows, Discrete Appl. Math., 4 (1982), pp. 303-323.
28. _, Negative circuits for flows and submodular flows, Discrete Appl. Math., 36 (1992), pp. 179-189.