Mixed-Integer Convex Representability
From MaRDI portal
Publication:5076722
DOI10.1287/moor.2021.1146zbMath1492.90093arXiv1706.05135OpenAlexW3204507036MaRDI QIDQ5076722
Miles Lubin, Ilias Zadik, Juan Pablo Vielma
Publication date: 17 May 2022
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1706.05135
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some properties of convex hulls of integer points contained in general convex sets
- Mixed-integer quadratic programming is in NP
- An algorithmic framework for convex mixed integer nonlinear programs
- Representability in mixed integer programming. I: Characterization results
- Second-order cone programming
- Polyhedral approximation in mixed-integer convex optimization
- Ellipsoidal mixed-integer representability
- A brief history of linear and mixed-integer programming computation
- A branch-and-cut method for 0-1 mixed convex programming
- Convex programming for disjunctive convex optimization
- Outer approximation with conic certificates for mixed-integer convex problems
- On the Chvátal-Gomory closure of a compact convex set
- Algorithms for joint sensor and control nodes selection in dynamic networks
- Small and strong formulations for unions of convex sets from the Cayley embedding
- Characterizations of mixed binary convex quadratic representable sets
- Mixed-integer convex representability
- Lectures on Modern Convex Optimization
- Mixed Integer Linear Programming Formulation Techniques
- The Chvátal-Gomory Closure of a Strictly Convex Body
- On the Complexity of Nonlinear Mixed-Integer Optimization
- FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs
- On Maximal S-Free Convex Sets
- Maximal Lattice-Free Convex Sets in Linear Subspaces
- Extended Formulations in Mixed-Integer Convex Programming
- On the Mixed Binary Representability of Ellipsoidal Regions
- Integer Programming
- Modelling with integer variables
- Closedness of Integer Hulls of Simple Conic Sets
- 50 Years of Integer Programming 1958-2008
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Diophantine Representation of the Set of Prime Numbers
- A framework for solving mixed-integer semidefinite programs
- A Strong Dual for Conic Mixed-Integer Programs
- A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints
- Mixed-Integer Linear Representability, Disjunctions, and Chvátal Functions—Modeling Implications
- Mixed Integer Programming: Analyzing 12 Years of Progress
- Representation of Sets of Lattice Points
This page was built for publication: Mixed-Integer Convex Representability
