On inequalities with bounded coefficients and pitch for the min knapsack polytope (Q2673233): Difference between revisions

@@ Property / cites work @@
+Q4952606
@@ Property / cites work: Q4952606 / rank @@
+Normal rank
@@ Property / cites work @@
+LP-Based Algorithms for Capacitated Facility Location
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for Knapsack Problems
+Normal rank
@@ Property / cites work @@
+Approximate formulations for 0-1 knapsack sets
@@ Property / cites work: Approximate formulations for 0-1 knapsack sets / rank @@
+Normal rank
@@ Property / cites work @@
+On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy
+Normal rank
@@ Property / cites work @@
+Small Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits
+Normal rank
@@ Property / cites work @@
+Integer Programming
@@ Property / cites work: Integer Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Subset Algebra Lift Operators for 0-1 Integer Programming
+Normal rank
@@ Property / cites work @@
+The complexity of cover inequality separation
@@ Property / cites work: The complexity of cover inequality separation / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate fixed-rank closures of covering problems
+Normal rank
@@ Property / cites work @@
+High degree sum of squares proofs, Bienstock-Zuckerberg hierarchy and CG cuts
+Normal rank
@@ Property / cites work @@
+On bounded pitch inequalities for the MIN-knapsack polytope
+Normal rank