Some properties of convex hulls of integer points contained in general convex sets

DOI10.1007/S10107-012-0538-7zbMath1300.90018OpenAlexW2026222212MaRDI QIDQ378131

Santanu S. Dey, Diego A. Morán R.

Publication date: 11 November 2013

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.416.6756

zbMATH Keywords

polyhedronconvex hullclosednessconvex integer programming

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (12)

Operations that Preserve the Covering Property of the Lifting Region ⋮ Closedness of Integer Hulls of Simple Conic Sets ⋮ Mixed-Integer Convex Representability ⋮ Mixed-Integer Linear Representability, Disjunctions, and Chvátal Functions—Modeling Implications ⋮ Mixed-integer bilevel representability ⋮ Some cut-generating functions for second-order conic sets ⋮ Intersection cuts for convex mixed integer programs from translated cones ⋮ Aggregation-based cutting-planes for packing and covering integer programs ⋮ Mixed Integer Linear Programming Formulation Techniques ⋮ Characterizations of mixed binary convex quadratic representable sets ⋮ On Subadditive Duality for Conic Mixed-integer Programs ⋮ Exact Augmented Lagrangian Duality for Mixed Integer Quadratic Programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extremal structure of convex sets
• Convex hulls of integral points
• Maximal Lattice-Free Convex Sets in Linear Subspaces
• Polyhedral Approaches to Mixed Integer Linear Programming
• On the existence of optimal solutions to integer and mixed-integer programming problems
• Representation of Sets of Lattice Points
• Convex Analysis

This page was built for publication: Some properties of convex hulls of integer points contained in general convex sets