Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles (Q3503866): Difference between revisions

@@ Property / cites work @@
+Intersection Cuts—A New Type of Cutting Planes for Integer Programming
+Normal rank
@@ Property / cites work @@
+Minimal Valid Inequalities for Integer Constraints
+Normal rank
@@ Property / cites work @@
+Chvátal closures for mixed integer programming problems
+Normal rank
@@ Property / cites work @@
+On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints
+Normal rank
@@ Property / cites work @@
+Some polyhedra related to combinatorial problems
@@ Property / cites work: Some polyhedra related to combinatorial problems / rank @@
+Normal rank
@@ Property / cites work @@
+Some continuous functions related to corner polyhedra
+Normal rank
@@ Property / cites work @@
+Some continuous functions related to corner polyhedra, II
+Normal rank
@@ Property / cites work @@
+T-space and cutting planes
@@ Property / cites work: T-space and cutting planes / rank @@
+Normal rank
@@ Property / cites work @@
+Corner polyhedra and their connection with cutting planes
+Normal rank
@@ Property / cites work @@
+Q4128251
@@ Property / cites work: Q4128251 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4040221
@@ Property / cites work: Q4040221 / rank @@
+Normal rank