NOTE ON MINKOWSKI SUMMATION AND UNIMODULARITY IN DISCRETE CONVEX ANALYSIS
Authors:
Open Access
- 31 October 2024
- journal article
- Published by The Operations Research Society of Japan in Journal of the Operations Research Society of Japan
- Vol. 67 (4) , 126-134
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 16 references indexed in Scilit:
- A survey of fundamental operations on discrete convex functions of various kindsOptimization Methods and Software, 2019
- Stability and competitive equilibria in multi-unit trading networks with discrete concave utility functionsJapan Journal of Industrial and Applied Mathematics, 2015
- Matroids and Geometric Invariant Theory of torus actions on flag spacesJournal of Algebra, 2007
- Discrete convexity and unimodularity—IAdvances in Mathematics, 2004
- Discrete Convex Analysis2003
- Convex Polytopes2003
- 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
- Graphs of Polytopes1995