A coordinatewise domain scaling algorithm for M-convex function minimization

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

Volumn 2337 LNCS, Issue , 2002, Pages 21-35

  Tamura, Akihisa ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; FUNCTIONS; POLYNOMIAL APPROXIMATION; ALGORITHMS; OPTIMIZATION;

DISCRETE FUNCTIONS; DISCRETE OPTIMIZATION; M-CONVEX FUNCTION MINIMIZATION; M-CONVEX FUNCTIONS; POLYNOMIAL-TIME; SCALING ALGORITHM; SCALING FACTORS;

INTEGER PROGRAMMING;

EID: 84868652833     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47867-1_3     Document Type: Conference Paper

References (29)

1. Cunningham, W. H. and Frank, A.: A Primal-dual Algorithm for Submodular Flows. Math. Oper. Res. 10 (1985) 251-262
2. Danilov, V., Koshevoy, G., Murota, K.: Discrete Convexity and Equilibria in Economies with Indivisible Goods and Money. Math. Social Sci. 41 (2001) 251-273
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. Edmonds, J.: Submodular Functions, Matroids and Certain Polyhedra. In: Guy, R., Hanani, H., Sauer, N., Schönheim, J. (eds.): Combinatorial Structures and Their Applications. Gordon and Breach, New York (1970) 69-87
6. Edmonds, J., Giles, R.: A Min-max Relation for Submodular Functions on Graphs. Ann. Discrete Math. 1 (1977) 185-204
7. Frank, A.: Generalized Polymatroids. In: Hajnal, A., Lovász, L., Sós, V. T. (eds.): Finite and Infinite Sets, I. North-Holland, Amsterdam (1984) 285-294
8. Frank, A., Tardos, É.: Generalized Polymatroids and Submodular Flows. Math. Program. 42 (1988) 489-563
9. Fujishige, S.: Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector. Math. Oper. Res. 5 (1980) 186-196
10. Fujishige, S.: Submodular Functions and Optimization. Annals of Discrete Mathematics 47, North-Holland, Amsterdam (1991)
11. Groenevelt, H.: Two Algorithms for Maximizing a Separable Concave Function over a Polymatroid Feasible Region. European J. Oper. Res. 54 (1991) 227-236
12. Hochbaum, D. S.: Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems. Math. Oper. Res. 19 (1994) 390-409
13. Iwata, S.: A Fully Combinatorial Algorithm for Submodular Function Minimization. J. Combin. Theory Ser. B (to appear)
14. Iwata, S., Shigeno, M.: Conjugate Scaling Algorithm for Fenchel-type Duality in Discrete Convex Optimization. SIAM J. Optim. (to appear)
15. Iwata, S., Fleischer, L., Fujishige, S.: A Combinatorial Strongly Polynomial Algorithm for Minimizing Submodular Functions. J. ACM 48 (2001) 761-777
16. Lovász, L.: Submodular Functions and Convexity. In: Bachem, A., Grötschel, M., Korte, B. (eds.): Mathematical Programming - The State of the Art. Springer-Verlag, Berlin (1983) 235-257
17. Moriguchi, S., Murota, K., Shioura, A.: Minimization of an M-convex Function with a Scaling Technique (in Japanese). IPSJ SIG Notes 2001-AL-76 (2001) 27-34
18. Moriguchi, S., Murota, K., Shioura, A.: Scaling Algorithms for M-convex Function Minimization. IEICE Trans. Fund. (to appear)
19. Murota, K.: Convexity and Steinitz's Exchange Property. Adv. Math. 124 (1996) 272-311
20. Murota, K.: Discrete Convex Analysis. Math. Program. 83 (1998) 313-371
21. Murota, K.: Submodular Flow Problem with a Nonseparable Cost Function. Combinatorica 19 (1999) 87-109
22. Murota, K.: Matrices and Matroids for Systems Analysis. Springer-Verlag, Berlin (2000)
23. Murota, K.: Discrete Convex Analysis (in Japanese). Kyoritsu Publ. Co., Tokyo (2001)
24. Murota, K., Shioura, A.: Quasi M-convex and L-convex functions: Quasi-convexity in discrete optimization. Discrete Appl. Math. (to appear)
25. Murota, K., Tamura, A.: New Characterizations of M-convex Functions and Their Applications to Economic Equilibrium Models with Indivisibilities. Discrete Appl. Math. (to appear)
26. Murota, K., Tamura, A.: Application of M-convex Submodular Flow Problem to Mathematical Economics. In: Eades, P., Takaoka, T. (eds.): Proceedings of 12th International Symposium on Algorithms and Computation, Lecture Notes in Computer Science, Vol. 2223. Springer-Verlag, Berlin Heidelberg New York (2001) 14-25
27. Rockafellar, R. T.: Convex Analysis. Princeton University Press, Princeton (1970)
28. Schrijver, A.: A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time. J. Combin. Theory Ser. B 80 (2000) 346-355
29. Shioura, A.: Minimization of an M-convex Function. Discrete Appl. Math. 84 (1998) 215-220