Note on multimodularity and L-convexity

Mathematics of Operations Research

Volumn 30, Issue 3, 2005, Pages 658-661

  Murota, Kazuo ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

Discrete convex function; L convex function; Local optimality; Multimodular function

Indexed keywords

MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS; PROBLEM SOLVING; THEOREM PROVING;

DISCRETE CONVEX FUNCTION; L-CONVEX FUNCTION; LOCAL OPTIMALITY; MULTIMODULAR FUNCTIONS;

OPERATIONS RESEARCH;

EID: 31144461405     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1040.0142     Document Type: Article

References (16)

1. Altman, E., B. Gaujal, A. Hordijk. 2000. Multimodularity, convexity, and optimization properties. Math. Oper. Res. 25 324-347.
2. Altman, E., B. Gaujal, A. Hordijk. 2003. Discrete-Event Control of Stochastic Networks: Multimodularity and Regularity. Lecture Notes in Mathematics, No. 1829. Springer-Verlag, Heidelberg, Germany, 2003.
3. Edmonds, J. 1970. Submodular functions, matroids and certain polyhedra. R. Guy, H. Hanani, N. Sauer, J. Schönheim, eds. Combinatorial Structures and Their Applications. Gordon and Breach, New York, 69-87.
4. Also: M. Junger, G. Reinelt, and G. Rinaldi, eds. 2003. Combinatorial optimization - Eureka, you shrink! Lecture Notes in Computer Science, No. 2570. Springer-Verlag, Berlin, Germany, 11-26.
5. Favati, P., F. Tardella. 1990. Convexity in nonlinear integer programming. Ricerca Operativa 53 3-44.
6. Fujishige, S. 1991. Submodular Functions and. Optimization. Annals of Discrete Mathematics, No. 47. North-Holland, Amsterdam, The Netherlands.
7. Fujishige, S., K. Murota. 2000. Notes on L-/M-convex functions and the separation theorems. Math. Programming 88 129-146.
8. Glasserman, P., D. D. Yao. 1994. Monotone Structure in Discrete-Event Systems. Wiley, New York.
9. Hajek, B. 1985. Extremal splittings of point processes. Math. Oper. Res. 10 543-556.
10. Koshevoy, G. A. 2003. Discrete convex analysis and its applications. Habilitation dissertation, CEMI, Moscow. (In Russian).
11. Lovász, L. 1983. Submodular functions and convexity. A. Bachem, M. Grötschel, B. Korte, eds. Mathematical Programming-The State of the Art. Springer-Verlag, Berlin, Germany, 235-257.
12. Murota, K. 1998. Discrete convex analysis. Math. Programming 83 313-371.
13. Murota, K. 2003. Discrete Convex Analysis. SIAM Monographs on Discrete Mathematics and Applications. Society for Industrial and Applied Mathematics, Philadelphia, PA.
14. Murota, K. 2003. On steepest descent algorithms for discrete convex functions. SIAM J. Optim. 14 699-707.
15. Tamura, A. 2004. Applications of discrete convex analysis to mathematical economics. Publ. Res. Inst. Math. Sci. 40 1015-1037.
16. Topkis. D. M. 1998. Supermodularity and Complementarity. Princeton University Press, Princeton, NJ.