Note on Minkowski Summation and Unimodularity in Discrete Convex Analysis

2023/12/04 by Kazuo Murota, Murota, Kazuo, Akihisa Tamura +1
Computer Science · #Combinatorics (math.CO) #FOS: Mathematics #Optimization and Variational Analysis

paper · pdf · doi:10.48550/arxiv.2312.01822

openalex publication_date 2023/12/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• Yet Another Convex Sets Subtraction with Application in Nondifferentiable Optimization
• Shapley-Folkman-type Theorem for Integrally Convex Sets
• Fundamentals in Discrete Convex Analysis
• Decomposition of an Integrally Convex Set into a Minkowski Sum of Bounded and Conic Integrally Convex Sets
• A Survey of Fundamental Operations on Discrete Convex Functions of Various Kinds