Fenchel-type duality for matroid valuations

Mathematical Programming, Series B

Volumn 82, Issue 3, 1998, Pages 357-375

  Murota, Kazuo ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

Combinatorial optimization; Convex analysis; Fenchel duality; Matroid intersection problem

Indexed keywords

EID: 0000811314     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01580075     Document Type: Article

References (21)

1. M.L. Balinski, The Hirsch conjecture for dual transportation polyhedra, Mathematics of Operations Research 9 (1984) 629-633.
2. M.L. Balinski, A. Russakoff, Faces of dual transportation polyhedra, Mathematical Programming Study 22 (1984) 1-8.
3. V. Chvátal, Linear programming, W.H. Freeman, Company, New York, 1983.
4. A.W.M. Dress, W. Wenzel, Valuated matroid: A new look at the greedy algorithm, Applied Mathematics Letters 3 (1990) 33-35.
5. A.W.M. Dress, W. Wenzel, Valuated matroids, Advances in Mathematics 93 (1992) 214-250.
6. J. Edmonds, Submodular functions, matroids and certain polyhedra, in: R. Guy, H. Hanani, N. Sauer, J. Schönsheim (Eds.), Combinatorial Structures and their Applications, Gordon and Breach, New York, 1970, pp. 69-87.
7. U. Faigle, Matroids in combinatorial optimization, in: N. White (Ed.), Combinatorial Geometries, Cambridge University Press, London, 1987, pp. 161-210.
8. A. Frank, A weighted matroid intersection algorithm, Journal of Algorithms 2 (1981) 328-336.
9. A. Frank, An algorithm for submodular functions on graphs, Annals of Discrete Mathematics 16 (1982) 97-120.
10. S. Fujishige, Theory of submodular programs: A Fenchel-type min-max theorem and subgradients of submodular functions, Mathematical Programming 29 (1984) 142-155.
11. S. Fujishige, On the subdifferential of a submodular function, Mathematical Programming 29 (1984) 348-360.
12. S. Fujishige, Submodular functions and optimization, Annals of Discrete Mathematics, vol. 47, North-Holland, Amsterdam, 1991.
13. M. Iri, N. Tomizawa, An algorithm for finding an optimal independent assignment, Journal of the Operations Research Society of Japan 19 (1976) 32-57.
14. E.L. Lawler, Combinatorial optimization: Networks and matroids, Holt, Rinehart and Winston, New York, 1976.
15. L. Lovász, Submodular functions and convexity, in: A. Bachem, M. Grötschel, B. Korte (Eds.), Mathematical Programming - The State of the Art, Springer, Berlin, 1983, pp. 235-257.
16. K. Murota, Valuated matroid intersection, I: Optimality criteria, SIAM Journal on Discrete Mathematics 9 (1996) 545-561.
17. K. Murota, Valuated matroid intersection, II: Algorithms, SIAM Journal on Discrete Mathematics 9 (1996) 562-576.
18. K. Murota, Convexity and Steinitz's exchange property, Advances in Mathematics 124 (1996) 272-311.
19. K. Murota, Discrete convex analysis, RIMS Preprint 1065, Kyoto University, Mathematical Programming, (to appear).
20. R.T. Rockafellar, Convex Analysis, Princeton University Press, Princeton, NJ, 1970.
21. J. Stoer, C. Witzgall, Convexity and Optimization in Finite Dimensions, vol. I, Springer, Berlin, 1970.