Cover and pack inequalities for (mixed) integer programming (Q817174): Difference between revisions

@@ Property / cites work @@
+Non-standard approaches to integer programming
@@ Property / cites work: Non-standard approaches to integer programming / rank @@
+Normal rank
@@ Property / cites work @@
+Cyclic group and knapsack facets
@@ Property / cites work: Cyclic group and knapsack facets / rank @@
+Normal rank
@@ Property / cites work @@
+Flow pack facets of the single node fixed-charge flow polytope
+Normal rank
@@ Property / cites work @@
+On capacitated network design cut-set polyhedra
@@ Property / cites work: On capacitated network design cut-set polyhedra / rank @@
+Normal rank
@@ Property / cites work @@
+On the facets of the mixed-integer knapsack polyhedron
+Normal rank
@@ Property / cites work @@
+Sequence Independent Lifting for Mixed-Integer Programming
+Normal rank
@@ Property / cites work @@
+On splittable and unsplittable flow capacitated network design arc-set polyhedra.
+Normal rank
@@ Property / cites work @@
+A directed cycle-based column-and-cut generation method for capacitated survivable network design
+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 @@
+Q3340498
@@ Property / cites work: Q3340498 / rank @@
+Normal rank
@@ Property / cites work @@
+Cutting planes for integer programs with general integer variables
+Normal rank
@@ Property / cites work @@
+Solving Large-Scale Zero-One Linear Programming Problems
+Normal rank
@@ Property / cites work @@
+Integer Programming and Combinatorial Optimization
+Normal rank
@@ Property / cites work @@
+An \(O(n \log n)\) procedure for identifying facets of the knapsack polytope.
+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 @@
+Lifted Cover Inequalities for 0-1 Integer Programs: Complexity
+Normal rank
@@ Property / cites work @@
+Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
+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 @@
+A note on the knapsack problem with special ordered sets
+Normal rank
@@ Property / cites work @@
+A Polyhedral Study of Integer Variable Upper Bounds
+Normal rank
@@ Property / cites work @@
+Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
+Normal rank
@@ Property / cites work @@
+Shortest paths, single origin‐destination network design, and associated polyhedra
+Normal rank
@@ Property / cites work @@
+The convex hull of two core capacitated network design problems
+Normal rank
@@ Property / cites work @@
+The 0-1 knapsack problem with a single continuous variable
+Normal rank
@@ Property / cites work @@
+Aggregation and Mixed Integer Rounding to Solve MIPs
+Normal rank
@@ Property / cites work @@
+Lifted cover facets of the 0-1 knapsack polytope with GUB constraints
+Normal rank
@@ Property / cites work @@
+A recursive procedure to generate all cuts for 0-1 mixed integer programs
+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 @@
+Covering, Packing and Knapsack Problems
@@ Property / cites work: Covering, Packing and Knapsack Problems / 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 @@
+(1,k)-configurations and facets for packing problems
+Normal rank
@@ Property / cites work @@
+The Sequential Knapsack Polytope
@@ Property / cites work: The Sequential Knapsack Polytope / rank @@
+Normal rank
@@ Property / cites work @@
+Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
+Normal rank
@@ Property / cites work @@
+Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms
+Normal rank
@@ Property / cites work @@
+Sequential and Simultaneous Liftings of Minimal Cover Inequalities for Generalized Upper Bound Constrained Knapsack Polytopes
+Normal rank
@@ Property / cites work @@
+Polyhedral results for the edge capacity polytope.
+Normal rank
@@ Property / cites work @@
+Hilbert Bases and the Facets of Special Knapsack Polytopes
+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