Generator subadditive functions for mixed-integer programs
From MaRDI portal
Cites work
- A practical algorithm for computing a subadditive dual function for set partitioning
- A strong dual for conic mixed-integer programs
- Additively separable duality theory
- An elementary survey of general duality theory in mathematical programming
- Approximating semidefinite packing programs
- Certificates of optimality for mixed integer linear programming using generalized subadditive generator functions
- Cutting-plane theory: Algebraic methods
- Duality for mixed-integer linear programs
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3555734 (Why is no real title available?)
- scientific article; zbMATH DE number 1234104 (Why is no real title available?)
- Integer points in arbitrary convex cones: the case of the PSD and SOC cones
- Lagrangian relaxation for integer programming
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Minimal inequalities
- On Subadditive Duality for Conic Mixed-integer Programs
- On the existence of optimal solutions to integer and mixed-integer programming problems
- Representation of Sets of Lattice Points
- Some Basis Theorems for Integral Monoids
- Some cut-generating functions for second-order conic sets
- Some properties of convex hulls of integer points contained in general convex sets
- Subadditive approaches in integer programming
- Theorems of the alternative for conic integer programming
This page was built for publication: Generator subadditive functions for mixed-integer programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7289061)
