On lifted cover inequalities: a new lifting procedure with unusual properties (Q2294273): Difference between revisions

@@ Property / cites work @@
+Cover and pack inequalities for (mixed) integer programming
+Normal rank
@@ Property / cites work @@
+Facets of the knapsack polytope
@@ Property / cites work: Facets of the knapsack polytope / rank @@
+Normal rank
@@ Property / cites work @@
+Facets of the Knapsack Polytope From Minimal Covers
+Normal rank
@@ Property / cites work @@
+Solving Large-Scale Zero-One Linear Programming Problems
+Normal rank
@@ Property / cites work @@
+Sequence independent lifting in mixed integer programming
+Normal rank
@@ Property / cites work @@
+The complexity of lifted inequalities for the knapsack problem
+Normal rank
@@ Property / cites work @@
+Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
+Normal rank
@@ Property / cites work @@
+Separation algorithms for 0-1 knapsack polytopes
@@ Property / cites work: Separation algorithms for 0-1 knapsack polytopes / rank @@
+Normal rank
@@ Property / cites work @@
+Technical Note—A Note on Zero-One Programming
@@ Property / cites work: Technical Note—A Note on Zero-One Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Faces for a linear inequality in 0–1 variables
@@ Property / cites work: Faces for a linear inequality in 0–1 variables / rank @@
+Normal rank
@@ Property / cites work @@
+Valid Inequalities and Superadditivity for 0–1 Integer Programs
+Normal rank
@@ Property / cites work @@
+Easily Computable Facets of the Knapsack Polytope
@@ Property / cites work: Easily Computable Facets of the Knapsack Polytope / rank @@
+Normal rank