Mixed-integer convex representability

DOI10.1007/978-3-319-59250-3_32zbMath1418.90179arXiv1611.07491OpenAlexW2552860034MaRDI QIDQ2401178

Juan Pablo Vielma, Ilias Zadik, Miles Lubin

Publication date: 31 August 2017

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

Mathematics Subject Classification ID

Convex programming (90C25) Mixed integer programming (90C11)

Related Items (9)

Ideal, non-extended formulations for disjunctive constraints admitting a network representation ⋮ Mixed-Integer Convex Representability ⋮ Mixed-Integer Linear Representability, Disjunctions, and Chvátal Functions—Modeling Implications ⋮ Shapes and recession cones in mixed-integer convex representability ⋮ Outer approximation with conic certificates for mixed-integer convex problems ⋮ Mixed-integer bilevel representability ⋮ A geometric way to build strong mixed-integer programming formulations ⋮ Characterizations of mixed binary convex quadratic representable sets ⋮ Stochastic Lipschitz dynamic programming

This page was built for publication: Mixed-integer convex representability