Note on the complexity of the mixed-integer hull of a polyhedron
Year of publication: |
2015
|
---|---|
Authors: | Hildebrand, Robert ; Oertel, Timm ; Weismantel, Robert |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 43.2015, 3, p. 279-282
|
Subject: | Mixed-integer hull | Polyhedron | Mixed-integer concave minimization | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
Cutting planes from two-term disjunctions
Bonami, Pierre, (2013)
-
Dupin, Nicolas, (2017)
-
Good clusterings have large volume
Borgwardt, Steffen, (2019)
- More ...
-
Integer convex minimization by mixed integer linear optimization
Oertel, Timm, (2014)
-
Minimizing cubic and homogeneous polynomials over integers in the plane
Del Pia, Alberto, (2016)
-
Basu, Amitabh, (2015)
- More ...