Notes on L-/M-convex functions and the separation theorems

DOI10.1007/s101070000160zbMath0974.90019MaRDI QIDQ1591359

Satoru Fujishige, Kazuo Murota

Publication date: 10 September 2001

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

submodularityseparation theoremsL-convex functionsM-convex functions

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)

Related Items

Quadratic M-convex and L-convex functions ⋮ Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems ⋮ Convex analysis and duality over discrete domains ⋮ Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested ⋮ Scaling, proximity, and optimization of integrally convex functions ⋮ Submodular functions: from discrete to continuous domains ⋮ Discrete Midpoint Convexity ⋮ Polyhedra with submodular support functions and their unbalanced simultaneous exchangeability ⋮ Quasi M-convex and L-convex functions -- quasiconvexity in discrete optimization ⋮ New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities. ⋮ Optimization problems with cone constraints in groups and semigroups: an approach based on image space analysis ⋮ Theory of Principal Partitions Revisited ⋮ Recent Developments in Discrete Convex Analysis ⋮ Discrete convexity built on differences ⋮ Projection and convolution operations for integrally convex functions ⋮ Application of M-convex submodular flow problem to mathematical economics ⋮ A framework of discrete DC programming by discrete convex analysis ⋮ L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem ⋮ Discrete convexity and unimodularity. I. ⋮ Conjugacy relationship between M-convex and L-convex functions in continuous variables ⋮ Applications of discrete convex analysis to mathematical economics ⋮ A note on discrete convexity and local optimality ⋮ Cone superadditivity of discrete convex functions ⋮ Directed discrete midpoint convexity ⋮ Relationship of M-/L-convex functions with discrete convex functions by Miller and Favati-Tardella. ⋮ Discrete Convex Functions on Graphs and Their Algorithmic Applications ⋮ Discrete convexity and polynomial solvability in minimum 0-extension problems ⋮ Convex Analysis in $\mathbb{Z}^n$ and Applications to Integer Linear Programming ⋮ Technical Note—Error Noted in “Order-Based Cost Optimization in Assemble-to-Order Systems” by Lu and Song (2005) ⋮ New algorithms for convex cost tension problem with application to computer vision ⋮ 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 ⋮ Discrete 2-convex functions ⋮ Substitutes and complements in network flows viewed as discrete convexity

This page was built for publication: Notes on L-/M-convex functions and the separation theorems