Note on Minkowski Summation and Unimodularity in Discrete Convex Analysis
Preprint
Abstract
This short note gives an elementary alternative proof for a theorem of Danilov and Koshevoy on Minkowski summation and unimodularity in discrete convex analysis. It is intended to disseminate this fundamental theorem and make its proof accessible to researchers in optimization and operations research.Keywords
All Related Versions
This publication has 10 references indexed in Scilit:
- A survey of fundamental operations on discrete convex functions of various kindsOptimization Methods and Software, 2019
- Discrete convex analysis: A tool for economics and game theoryJournal of Mechanism and Institution Design, 2016
- Stability and competitive equilibria in multi-unit trading networks with discrete concave utility functionsJapan Journal of Industrial and Applied Mathematics, 2015
- STABILITY IN SUPPLY CHAIN NETWORKS: AN APPROACH BY DISCRETE CONVEX ANALYSISJournal of the Operations Research Society of Japan, 2015
- Discrete convexity and unimodularity—IAdvances in Mathematics, 2004
- Relationship of M-/L-convex functions with discrete convex functions by Miller and Favati–TardellaDiscrete Applied Mathematics, 2001
- Discrete convexity and equilibria in economies with indivisible goods and moneyMathematical Social Sciences, 2001
- Maximal Unimodular Systems of VectorsEuropean Journal of Combinatorics, 1999
- M-Convex Function on Generalized PolymatroidMathematics of Operations Research, 1999
- Discrete convex analysisMathematical Programming, 1998