Convex sets and minimal sublinear functions
From MaRDI portal
Publication:2997129
Recommendations
Cited in
(20)- A geometric approach to cut-generating functions
- On Closed Sets Having A Least Element
- On minimal valid inequalities for mixed integer conic programs
- On a support function on a convex cone
- Minimum recession-compatible subsets of closed convex sets
- Minimal pairs representing selections of four linear functions in \(\mathbb{R}^3\)
- The smallest convex extensions of a convex function
- Outer-product-free sets for polynomial optimization and oracle-based cuts
- Nonunique lifting of integer variables in minimal inequalities
- Cut-generating functions and \(S\)-free sets
- Bounds on the minimum of convex functions on Euclidean combinatorial sets
- Minsum location extended to gauges and to convex sets
- Convex Sets and Subharmonicity of the Distance Function
- Relaxations of mixed integer sets from lattice-free polyhedra
- Intersection Disjunctions for Reverse Convex Sets
- Relaxations of mixed integer sets from lattice-free polyhedra
- Convergence of Minimal Sets in Convex Vector Optimization
- Minimization of a convex functional on a class of sets in a measure space
- scientific article; zbMATH DE number 2121696 (Why is no real title available?)
- Convex analysis in \(\mathbb{Z}^n\) and applications to integer linear programming
This page was built for publication: Convex sets and minimal sublinear functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2997129)