Integer quadratic quasi-polyhedra
From MaRDI portal
Publication:3569823
Recommendations
Cited in
(7)- Valid inequalities for quadratic optimisation with domain constraints
- Gap inequalities for non-convex mixed-integer quadratic programs
- On the separation of split inequalities for non-convex quadratic integer programming
- Arithmetic Discrete Planes Are Quasicrystals
- On families of quadratic surfaces having fixed intersections with two hyperplanes
- On the facet defining inequalities of the mixed-integer bilinear covering set
- Unbounded convex sets for non-convex mixed-integer quadratic programming
This page was built for publication: Integer quadratic quasi-polyhedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569823)