Characterizations of mixed binary convex quadratic representable sets
From MaRDI portal
Publication:2316624
DOI10.1007/s10107-018-1274-4zbMath1422.90025OpenAlexW2799324311WikidataQ57568034 ScholiaQ57568034MaRDI QIDQ2316624
Alberto Del Pia, Jeffrey Poskin
Publication date: 6 August 2019
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-018-1274-4
Related Items (2)
Mixed-Integer Convex Representability ⋮ Shapes and recession cones in mixed-integer convex representability
Cites Work
- Unnamed Item
- Unnamed Item
- Some properties of convex hulls of integer points contained in general convex sets
- Mixed-integer quadratic programming is in NP
- Algorithm for cardinality-constrained quadratic optimization
- Semidefinite representation of convex sets
- Representability in mixed integer programming. I: Characterization results
- Applications of second-order cone programming
- Ellipsoidal mixed-integer representability
- Computational study of a family of mixed-integer quadratic programming problems
- Mixed-integer convex representability
- Quadratic programming is in NP
- Mixed Integer Linear Programming Formulation Techniques
- On the Mixed Binary Representability of Ellipsoidal Regions
- Modelling with integer variables
- Linear matrix inequality representation of sets
- Convex Analysis
This page was built for publication: Characterizations of mixed binary convex quadratic representable sets