Convex Sets and Minimal Sublinear Functions

zbMath1220.26009arXiv1701.06550MaRDI QIDQ2997129

Amitabh Basu, Cornuéjols, Gérard, Giacomo Zambelli

Publication date: 6 May 2011

Full work available at URL: https://arxiv.org/abs/1701.06550

zbMATH Keywords

integer programmingconvexityconvex setssublinear function

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Convexity of real functions of several variables, generalizations (26B25) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Related Items (8)

Intersection Disjunctions for Reverse Convex Sets ⋮ Outer-product-free sets for polynomial optimization and oracle-based cuts ⋮ Nonunique Lifting of Integer Variables in Minimal Inequalities ⋮ Relaxations of mixed integer sets from lattice-free polyhedra ⋮ Relaxations of mixed integer sets from lattice-free polyhedra ⋮ On Minimal Valid Inequalities for Mixed Integer Conic Programs ⋮ Cut-Generating Functions and S-Free Sets ⋮ A geometric approach to cut-generating functions

This page was built for publication: Convex Sets and Minimal Sublinear Functions