Decomposition of an Integrally Convex Set into a Minkowski Sum of Bounded and Conic Integrally Convex Sets

DOI10.1007/S13160-023-00635-1MaRDI QIDQ6440404zbMATH OpenOpenAlexFDO

Authors Kazuo Murota, Akihisa Tamura

Publication date 15 June 2023

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s13160-023-00635-1

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Convex and discrete geometry (52-XX)

Abstract: Every polyhedron can be decomposed into a Minkowski sum (or vector sum) of a bounded polyhedron and a polyhedral cone. This paper establishes similar statements for some classes of discrete sets in discrete convex analysis, such as integrally convex sets, L-natural-convex sets, and M-natural-convex sets.

Recommendations

• Note on the polyhedral description of the Minkowski sum of two L-convex sets
• Integral decomposition of polyhedra and some applications in mixed integer programming
• Integer decomposition property of free sums of convex polytopes
• scientific article; zbMATH DE number 2159405
• Minkowski sum of polytopes and its normality

This page was built for publication: Decomposition of an Integrally Convex Set into a Minkowski Sum of Bounded and Conic Integrally Convex Sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6440404)