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.
| Original language | English |
|---|---|
| Pages (from-to) | 126-134 |
| Number of pages | 9 |
| Journal | Journal of the Operations Research Society of Japan |
| Volume | 67 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - 2024 Oct |
Keywords
- Discrete optimization
- M ♮-convex set
- Minkowski sum
- discrete convex analysis
- unimodular matrix
ASJC Scopus subject areas
- General Decision Sciences
- Management Science and Operations Research