Faces for a linear inequality in 0–1 variables (Q4074671): Difference between revisions

@@ Property / cites work @@
+Canonical Cuts on the Unit Hypercube
@@ Property / cites work: Canonical Cuts on the Unit Hypercube / rank @@
+Normal rank
@@ Property / cites work @@
+Facets of the knapsack polytope
@@ Property / cites work: Facets of the knapsack polytope / rank @@
+Normal rank
@@ Property / cites work @@
+Coefficient reduction for inequalities in 0–1 variables
+Normal rank
@@ Property / cites work @@
+Q5632593
@@ Property / cites work: Q5632593 / rank @@
+Normal rank
@@ Property / cites work @@
+Matroids and the greedy algorithm
@@ Property / cites work: Matroids and the greedy algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum matching and a polyhedron with 0,1-vertices
+Normal rank
@@ Property / cites work @@
+Q5684698
@@ Property / cites work: Q5684698 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5547252
@@ Property / cites work: Q5547252 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4060733
@@ Property / cites work: Q4060733 / rank @@
+Normal rank
@@ Property / cites work @@
+Facet of regular 0–1 polytopes
@@ Property / cites work: Facet of regular 0–1 polytopes / rank @@
+Normal rank
@@ Property / cites work @@
+Properties of vertex packing and independence system polyhedra
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01580441
+Normal rank
@@ Property / OpenAlex ID @@
+W2064366623
@@ Property / OpenAlex ID: W2064366623 / rank @@
+Normal rank