Shapes and recession cones in mixed-integer convex representability

DOI10.1007/s10107-023-01946-4arXiv2103.03379OpenAlexW3135447600MaRDI QIDQ6120855

Ilias Zadik, Juan Pablo Vielma, Miles Lubin

Publication date: 21 February 2024

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

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

zbMATH Keywords

mixed-integer convex optimizationmixed-integer programming formulationsmixed-integer programming representability

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Representability in mixed integer programming. I: Characterization results
• Ellipsoidal mixed-integer representability
• A branch-and-cut method for 0-1 mixed convex programming
• Convex programming for disjunctive convex optimization
• Characterizations of mixed binary convex quadratic representable sets
• Mixed-integer convex representability
• On the equality conditions of the Brunn-Minkowski theorem
• On the Mixed Binary Representability of Ellipsoidal Regions
• Modelling with integer variables
• Mixed-Integer Convex Representability

This page was built for publication: Shapes and recession cones in mixed-integer convex representability