Convexity and Steinitz's exchange property: (Extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1084, Issue , 1996, Pages 260-274

  Murota, Kazuo ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; INTEGRAL EQUATIONS; LATTICE THEORY;

CONCAVE FUNCTION; CONVEX ANALYSIS; EXTENDED ABSTRACTS; LINEAR FUNCTIONS; MATROID INTERSECTION; SEPARABLE CONCAVE FUNCTIONS; SEPARATION THEOREM; SUBMODULAR FUNCTIONS;

INTEGER PROGRAMMING;

EID: 84947926323     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61310-2_20     Document Type: Conference Paper

References (18)

1. Dress, A. W. M., Terhalle, W.: Well-layered maps and the maximum-degree k×k- subdetermìnant of a matrix of rational functions. Appl. Math. Lett. 8 (1995) 19-23
2. Dress, A. W. M., Terhalle, W.: Well-layered maps-A class of greedily optimizable set functions. Appl. Math. Lett. 8 (1995) 77-80
3. Dress, A. W. M., Wenzel, W.: Valuated matroid: A new look at the greedy algorithm. Appl. Math. Lett. 3 (1990) 33-35
4. Dress, A. W-M., Wenzel, W.: Valuated matroids. Adv. Math. 93 (1992) 214-250
5. Frank, A.: A weighted matroid intersection algorithm. J. Algorithms 2 (1981) 328-336
6. Frank, A.: An algorithm for submodular functions on graphs. Ann. Disc. Math. 16 (1982) 97-120
7. Fujishige, S.: Lexicographically optimal base of a polymatroid with respect to a weight vector. Math. Oper. Res. 5 (1980) 186-196
8. Fujishige, S.: Theory of submodular programs: A Fenchel-type min-max theorem and subgradients of submodular functions. Math. Progr. 29 (1984) 142-155
9. Fujishige, S.: Submodular Functions and Optimization. Ann. Disc. Math. 47, North-Holland, 1991
10. Groenevelt, H.: Two algorithms for maximizing a separable concave function over a polymatroid feasible region. Working Paper, Grad. School Management, Univ. Rochester, 1995.
11. Iri, M., Tomizawa, N.: An algorithm for finding an optimal "independent assignment." J. Oper. Res. Soc. Japan 19 (1976) 32-57
12. Lovász, L.: Submodular functions and convexity. In "Mathematical Programming-The State of the Art" (A. Bachem, M. Grötschel and B. Korte, eds.), Springer, 235-257, 1983
13. Murota, K.: Finding optimal minors of valuated bimatroids. Appl. Math. Lett. 8 (1995) 37-42
14. Murota, K.: Valuated matroid intersection, I: optimality criteria, II: algorithms. SIAM J. Disc. Math. 9 (1996) No.3 (to appear)
15. Murota, K.: Matroid valuation on independent sets. Report 95842-OR, Inst. Disc. Math., Univ. Bonn, 1995
16. Murota, K.: Submodular flow problem with a nonseparable cost function. Report 95843-OR, Inst. Disc. Math., Univ. Bonn, 1995
17. Murota, K.: Convexity and Steinitz's exchange property. Report 95848-OR, Inst. Disc. Math., Univ. Bonn, 1995
18. Rockafellar, R. T.: Convex Analysis. Princeton Univ. Press, 1970