Closedness of Integer Hulls of Simple Conic Sets

DOI10.1137/140982210zbMath1330.90056OpenAlexW2286711937MaRDI QIDQ3462546

Diego A. Morán, Santanu S. Dey

Publication date: 15 January 2016

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/dd6d5beee2734d57f1873bb16fc4d2a64b9c342b

zbMATH Keywords

polynomial-time algorithmclosednessmixed-integer convex programming

Mathematics Subject Classification ID

Mixed integer programming (90C11) Abstract computational complexity for mathematical programming problems (90C60)

Related Items

Mixed-Integer Convex Representability, On Subadditive Duality for Conic Mixed-integer Programs

Cites Work

• Some properties of convex hulls of integer points contained in general convex sets
• Convex hulls of integral points
• Unbounded convex sets for non-convex mixed-integer quadratic programming
• On Maximal S-Free Convex Sets
• Maximal Lattice-Free Convex Sets in Linear Subspaces
• On the existence of optimal solutions to integer and mixed-integer programming problems
• A Polynomial-Time Algorithm to Check Closedness of Simple Second Order Mixed-Integer Sets
• Facial Structure and Representation of Integer Hulls of Convex Sets
• Systems of distinct representatives and linear algebra
• Convex Analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item