Lifting, superadditivity, mixed integer rounding and single node flow sets revisited (Q5920488): Difference between revisions

@@ Property / cites work @@
+Flow pack facets of the single node fixed-charge flow polytope
+Normal rank
@@ Property / cites work @@
+On the facets of the mixed-integer knapsack polyhedron
+Normal rank
@@ Property / cites work @@
+A study of the lot-sizing polytope
@@ Property / cites work: A study of the lot-sizing polytope / rank @@
+Normal rank
@@ Property / cites work @@
+Valid inequalities for problems with additive variable upper bounds
+Normal rank
@@ Property / cites work @@
+Facets of the knapsack polytope
@@ Property / cites work: Facets of the knapsack polytope / 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 @@
+Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds
+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 @@
+An Introduction to the Theory of Cutting-Planes
@@ Property / cites work: An Introduction to the Theory of Cutting-Planes / rank @@
+Normal rank
@@ Property / cites work @@
+Q5183269
@@ Property / cites work: Q5183269 / rank @@
+Normal rank
@@ Property / cites work @@
+Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
+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 @@
+A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case
+Normal rank
@@ Property / cites work @@
+On the polyhedral structure of a multi-item production planning model with setup times
+Normal rank
@@ Property / cites work @@
+Q4040221
@@ Property / cites work: Q4040221 / rank @@
+Normal rank
@@ Property / cites work @@
+A recursive procedure to generate all cuts for 0-1 mixed integer programs
+Normal rank
@@ Property / cites work @@
+Q4343708
@@ Property / cites work: Q4343708 / 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 @@
+Valid Linear Inequalities for Fixed Charge Problems
+Normal rank
@@ Property / cites work @@
+Q4737525
@@ Property / cites work: Q4737525 / rank @@
+Normal rank
@@ Property / cites work @@
+Lifted inequalities for 0-1 mixed integer programming: superlinear lifting
+Normal rank
@@ Property / cites work @@
+The complementary class of generalized flow cover inequalities
+Normal rank
@@ Property / cites work @@
+Valid inequalities for mixed 0-1 programs
@@ Property / cites work: Valid inequalities for mixed 0-1 programs / rank @@
+Normal rank
@@ Property / cites work @@
+Solving Mixed Integer Programming Problems Using Automatic Reformulation
+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 @@
+Submodularity and valid inequalities in capacitated fixed charge networks
+Normal rank
@@ Property / cites work @@
+Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints
+Normal rank