On fundamental operations for multimodular functions
From MaRDI portal
Abstract: Multimodular functions, primarily used in the literature of queueing theory, discrete-event systems, and operations research, constitute a fundamental function class in discrete convex analysis. The objective of this paper is to clarify the properties of multimodular functions with respect to fundamental operations such as permutation and scaling of variables, projection (partial minimization) and convolution. It is shown, in particular, that the class of multimodular functions is stable under projection under a certain natural condition on the variables to be minimized, and the convolution of two multimodular functions is not necessarily multimodular, even in the special case of the convolution of a multimodular function with a separable convex function.
Recommendations
- Note on Multimodularity and L-Convexity
- A survey of fundamental operations on discrete convex functions of various kinds
- On basic operations related to network induction of discrete convex functions
- Multimodularity, convexity, and optimization properties
- Projection and convolution operations for integrally convex functions
Cited in
(7)- Note on the polyhedral description of the Minkowski sum of two L-convex sets
- Multimodularity, convexity, and optimization properties
- A survey of fundamental operations on discrete convex functions of various kinds
- On basic operations related to network induction of discrete convex functions
- M-Convex Function Minimization Under L1-Distance Constraint and Its Application to Dock Reallocation in Bike-Sharing System
- Note on Multimodularity and L-Convexity
- Recent progress on integrally convex functions
This page was built for publication: On fundamental operations for multimodular functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5240022)
