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

DOI10.1007/S10107-012-0538-7zbMATH Open1300.90018OpenAlexW2026222212MaRDI QIDQ378131FDOQ378131

Authors: Santanu S. Dey, Diego Morán 

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

Recommendations

• Convex hulls of integral points
• scientific article; zbMATH DE number 4092244
• scientific article; zbMATH DE number 1960412
• Closedness of integer hulls of simple conic sets
• scientific article; zbMATH DE number 4115425

zbMATH Keywords

convex hullpolyhedronclosednessconvex integer programming

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Convex Analysis
• Maximal lattice-free convex sets in linear subspaces
• Extremal structure of convex sets
• On the existence of optimal solutions to integer and mixed-integer programming problems
• Convex hulls of integral points
• Title not available (Why is that?)
• Polyhedral approaches to mixed integer linear programming
• Title not available (Why is that?)
• Representation of Sets of Lattice Points

Cited In (18)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Exact augmented Lagrangian duality for mixed integer quadratic programming
• Intersection cuts for convex mixed integer programs from translated cones
• Some cut-generating functions for second-order conic sets
• Mixed-integer linear representability, disjunctions, and Chvátal functions -- modeling implications
• Mixed integer linear programming formulation techniques
• Operations that preserve the covering property of the lifting region
• Aggregation-based cutting-planes for packing and covering integer programs
• Mixed-integer convex representability
• Title not available (Why is that?)
• An algorithm for determining the minimal convex subset that contains all the integer points of a convex polyhedral set
• Mixed-integer bilevel representability
• The convex hull of the integer points in a large ball
• Closedness of integer hulls of simple conic sets
• Convex hulls of integral points
• On Subadditive Duality for Conic Mixed-integer Programs
• Characterizations of mixed binary convex quadratic representable sets

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

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