Note on Minkowski Summation and Unimodularity in Discrete Convex Analysis
Combinatorics
2024-04-30 v2
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.
Cite
@article{arxiv.2312.01822,
title = {Note on Minkowski Summation and Unimodularity in Discrete Convex Analysis},
author = {Kazuo Murota and Akihisa Tamura},
journal= {arXiv preprint arXiv:2312.01822},
year = {2024}
}
Comments
10 pages