Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes (Q951099): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disopt.2007.05.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2036861438
@@ Property / OpenAlex ID: W2036861438 / 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 @@
+Facets of the Knapsack Polytope From Minimal Covers
+Normal rank
@@ Property / cites work @@
+An Algorithm for Large Zero-One Knapsack Problems
@@ Property / cites work: An Algorithm for Large Zero-One Knapsack Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q3340498
@@ Property / cites work: Q3340498 / rank @@
+Normal rank
@@ Property / cites work @@
+Hard Knapsack Problems
@@ Property / cites work: Hard Knapsack Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Discrete-Variable Extremum Problems
@@ Property / cites work: Discrete-Variable Extremum Problems / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm for the solution of the 0-1 knapsack problem
+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 @@
+Corner polyhedra and their connection with cutting planes
+Normal rank
@@ Property / cites work @@
+Facets of the knapsack polytope derived from disjoint and overlapping index configurations
+Normal rank
@@ Property / cites work @@
+Sequence independent lifting in mixed integer programming
+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 @@
+Simple lifted cover inequalities and hard knapsack problems
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+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 @@
+Q3792481
@@ Property / cites work: Q3792481 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3751378
@@ Property / cites work: Q3751378 / rank @@
+Normal rank
@@ Property / cites work @@
+A New Algorithm for the 0-1 Knapsack Problem
@@ Property / cites work: A New Algorithm for the 0-1 Knapsack Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4040221
@@ Property / cites work: Q4040221 / rank @@
+Normal rank
@@ Property / cites work @@
+On the facial structure of set packing polyhedra
@@ Property / cites work: On the facial structure of set packing polyhedra / rank @@
+Normal rank
@@ Property / cites work @@
+On the \(0/1\) knapsack polytope
@@ Property / cites work: On the \(0/1\) knapsack polytope / 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 @@
+Technical Note—Facets and Strong Valid Inequalities for Integer Programs
+Normal rank
@@ Property / cites work @@
+Valid Inequalities and Superadditivity for 0–1 Integer Programs
+Normal rank
@@ Property / cites work @@
+Lifting the facets of zero–one polytopes
@@ Property / cites work: Lifting the facets of zero–one polytopes / rank @@
+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