Relationship of M-/L-convex functions with discrete convex functions by Miller and Favati-Tardella.

DOI10.1016/S0166-218X(01)00222-0zbMath1076.90036WikidataQ127656684 ScholiaQ127656684MaRDI QIDQ5954245

Kazuo Murota, Akiyoshi Shioura

Publication date: 2001

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Convex programming (90C25) Integer programming (90C10) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

Discrete Fenchel duality for a pair of integrally convex and separable convex functions, On the complexity of energy storage problems, Recent progress on integrally convex functions, An envelope operator for full convexity to define polyhedral models in digital spaces, Identifying combinatorial valuations from aggregate demand, Full convexity for polyhedral models in digital spaces, New sufficient conditions for strong unimodality of multivariate discrete distributions, New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities., DISCRETE CONCAVITY FOR POTENTIAL GAMES, Discrete convexity built on differences, Projection and convolution operations for integrally convex functions, Application of M-convex submodular flow problem to mathematical economics, Approximating optimization problems over convex functions, Conjugacy relationship between M-convex and L-convex functions in continuous variables, \(M\)-convex functions and tree metrics, Applications of discrete convex analysis to mathematical economics, A general two-sided matching market with discrete concave utility functions, A dynamic programming framework for optimal delivery time slot pricing, Greedy systems of linear inequalities and lexicographically optimal solutions, Integrality of subgradients and biconjugates of integrally convex functions, Gradient-bounded dynamic programming for submodular and concave extensible value functions with probabilistic performance guarantees, A survey of fundamental operations on discrete convex functions of various kinds, On basic operations related to network induction of discrete convex functions, Extension of M-convexity and L-convexity to polyhedral convex functions, Substitutes and complements in network flows viewed as discrete convexity, Note on the polyhedral description of the Minkowski sum of two L-convex sets

Cites Work

• Convexity and Steinitz's exchange property
• A note on Frank's generalized polymatroids
• Generalized polymatroids and submodular flows
• Submodular flow problem with a nonseparable cost function
• Submodular functions and optimization
• Discrete convex analysis
• Notes on L-/M-convex functions and the separation theorems
• An approach to nonlinear programming
• M-Convex Function on Generalized Polymatroid
• On Minimizing Nonseparable Functions Defined on the Integers with an Inventory Application
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item