Characterizing a valuated delta-matroid as a family of delta-matroids

Journal of the Operations Research Society of Japan

Volumn 40, Issue 4, 1997, Pages 565-578

  Murota, Kazuo ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0009116617     PISSN: 04534514     EISSN: None     Source Type: Journal    
DOI: 10.15807/jorsj.40.565     Document Type: Article

References (42)

1. K. Ando, S. Fujishige and T. Naitoh: A greedy algorithm for minimizing a separable convex function over a finite jump system, Journal of the. Operations Research Society of Japan, 38 (1995), pp. 362-375.
2. A. Bouchet: Greedy algorithm and symmetric matroids, Mathematical Programming, 38 (1987), pp. 147-159.
3. A. Bouchet: Matchings and Δ-matroids, Discrete Applied Mathematics, 24 (1989), pp. 55-62.
4. A. Bouchet and W. H. Cunningham: Delta-matroids, jump systems, and bisubmodular polyhedra, SIAM Journal on Discrete Mathematics, 8 (1995), pp. 17-32.
5. A. Bouchet, A. W. M. Dress and T. Havel: Δ-matroids and metroids, Advances in Mathematics, 91 (1992), pp. 136-142.
6. R. Chandrasekaran and S. N. Kabadi: Pseudomatroids, Discrete Mathematics, 71 (1988), pp. 205-217.
7. A. W. M. Dress and T. Havel: Some combinatorial properties of discriminants in metric vector spaces, Advances in Mathematics, 62 (1986), pp. 285-312.
8. A. W. M. Dress and W. Terhalle: Well-layered maps - A class of greedily optimizable set functions, Applied Mathematics Letters, 8 (1995), pp. 77-80.
9. A. W. M. Dress and W. Terhalle: Well-layered maps and the maximum-degree k x k-subdeterminant of a matrix of rational functions, Applied Mathematics Letters, 8 (1995), pp. 19-23.
10. A. W. M. Dress and W. Terhalle: Rewarding maps - On greedy optimization of set functions, Advances in Applied Mathematics, 16 (1995), pp. 464-483.
11. A. W. M. Dress and W. Wenzel: Valuated matroid: A new look at the greedy algorithm, Applied Mathematics Letters, 3 (1990), pp. 33-35.
12. A. W. M. Dress and W. Wenzel: A greedy-algorithm characterization of valuated Δ-matroids, Applied Mathematics Letters, 4 (1991), pp. 55-58.
13. A. W. M. Dress and W. Wenzel: Perfect matroids, Advances in Mathematics, 91 (1992), pp. 158-208.
14. A. W. M. Dress and W. Wenzel: Valuated matroids, Advances in Mathematics, 93 (1992), pp. 214-250.
15. J. Edmonds: Submodular functions, matroids and certain polyhedra, in Combinatorial Structures and Their Applications (R. Guy, H. Hanani, N. Sauer and J. Schönheim, eds.), Gordon and Breach, New York, pp. 69-87, 1970.
16. J. Edmonds: Matroid intersection, Annals of Discrete Mathematics, 4 (1979), pp. 39-49.
17. U. Faigle: Matroids in combinatorial optimization, in Combinatorial Geometries (N. White, ed.), Cambridge University Press, London, pp. 161-210, 1987.
18. P. Favati and F. Tardella: Convexity in nonlinear integer programming, Ricerca Operativa, 53 (1990), pp. 3-44.
19. S. Fujishige: Submodular Functions and Optimization, Annals of Discrete Mathematics, 47, North-Holland, 1991.
20. D. S. Hochbaum and S.-P. Hong: About strongly polynomial time algorithms for quadratic optimization over submodular constraints, Mathematical Programming, 69 (1995), pp. 269-309.
21. B. Korte, L. Lovász and R. Schrader: Greedoids, Springer-Verlag, Berlin, 1991.
22. L. Lovász: Submodular functions and convexity, in Mathematical Programming - The State of the Art (A. Bachern, M. Grötschel and B. Korte, eds.), Springer-Verlag, Berlin, pp. 235-257, 1983.
23. L. Lovász and M. Plummer: Matching Theory, North-Holland, Amsterdam, 1986.
24. K. Murota: Finding optimal minors of valuated bimatroids, Applied Mathematics Letters, 8 (1995), pp. 37-42.
25. K. Murota: Two algorithms for valuated Δ-matroids, Applied Mathematics Letters, 9 (1996), pp. 67-71.
26. K. Murota: Valuated matroid intersection, I: optimality criteria, SIAM Journal on Discrete Mathematics, 9 (1996), pp. 545-561.
27. K. Murota: Valuated matroid intersection, II: algorithms, SIAM Journal on Discrete Mathematics, 9 (1996), pp. 562-576.
28. K. Murota: Fenchel-type duality for matroid valuations, Mathematical Programming, to appear.
29. K. Murota: Submodular flow problem with a nonseparable cost function, Report No. 95843-OR, Forschungsinstitut für Diskrete Mathematik, Universität Bonn, March, 1995.
30. K. Murota: Convexity and Steinitz's exchange property, Advances in Mathematics, 124 (1996), 272-311.
31. Extended abstract in Integer Programming and Combinatorial Optimization (W. H. Cunningham, S. T. McCormick, and M. Queyranne, eds.), Proceedings of 5th International IPCO Conference, Vancouver, British Columbia, Canada, June 3-5, 1996. Lecture Notes in Computer Science 1084, Springer-Verlag, 1996, pp. 260-274.
32. K. Murota: Discrete convex analysis, RIMS Preprint No. 1065, Research Institute for Mathematical Sciences, Kyoto University, April, 1996.
33. K. Murota and A. Shioura: M-convex function on generalized polymatroid, Research Reports on Mathematical and Computing Sciences, Tokyo Institute of Technology, B-320, September, 1996.
34. M. Nakamura: A characterization of greedy sets: universal polynamtroids (I), Scientific Papers College Arts and Sciences, Univ. Tokyo, 38 (1988), pp. 155-167.
35. L. Qi: Directed submodularity, ditroids and directed submodular flows, Mathematical Programming, 42 (1988), pp. 579-599.
36. R. T. Rockafellar: Convex Analysis, Princeton University Press, Princeton, NJ, 1970.
37. A. Schrijver: Theory of Linear and Integer Programming, Wiley, Chichester, 1986.
38. J. Stoer and C. Witzgall: Convexity and Optimization in Finite Dimensions I, Springer-Verlag, Berlin, 1970.
39. D. J. A. Welsh: Matroid Theory, Academic Press, London, 1976.
40. W. Wenzel: Pfaffian forms and Δ-matroids, Discrete Mathematics, 115 (1993), pp. 253-266.
41. W. Wenzel: Δ-matroids with the strong exchange conditions, Applied Mathematics Letters, 6 (1993), pp. 67-70.
42. N. White, ed.: Theory of Matroids, Cambridge University Press, London, 1986.