Computing deep facet-defining disjunctive cuts for mixed-integer programming (Q847850): Difference between revisions

@@ Property / cites work @@
+Q3818127
@@ Property / cites work: Q3818127 / rank @@
+Normal rank
@@ Property / cites work @@
+Generating Fenchel Cutting Planes for Knapsack Polyhedra
+Normal rank
@@ Property / cites work @@
+Fenchel Cutting Planes for Integer Programs
@@ Property / cites work: Fenchel Cutting Planes for Integer Programs / rank @@
+Normal rank
@@ Property / cites work @@
+On the Convergence of Fenchel Cutting Planes in Mixed-Integer Programming
+Normal rank
@@ Property / cites work @@
+Intersection Cuts—A New Type of Cutting Planes for Integer Programming
+Normal rank
@@ Property / cites work @@
+Disjunctive Programming
@@ Property / cites work: Disjunctive Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Strengthening cuts for mixed integer programs
@@ Property / cites work: Strengthening cuts for mixed integer programs / rank @@
+Normal rank
@@ Property / cites work @@
+A lift-and-project cutting plane algorithm for mixed 0-1 programs
+Normal rank
@@ Property / cites work @@
+Valid inequalities for mixed integer linear programs
+Normal rank
@@ Property / cites work @@
+A convex-analysis perspective on disjunctive cuts
@@ Property / cites work: A convex-analysis perspective on disjunctive cuts / rank @@
+Normal rank
@@ Property / cites work @@
+Q2753173
@@ Property / cites work: Q2753173 / rank @@
+Normal rank
@@ Property / cites work @@
+Branching on general disjunctions
@@ Property / cites work: Branching on general disjunctions / rank @@
+Normal rank
@@ Property / cites work @@
+Q4537754
@@ Property / cites work: Q4537754 / rank @@
+Normal rank
@@ Property / cites work @@
+A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
+Normal rank
@@ Property / cites work @@
+Convex normalizations in lift-and-project methods for 0--1 programming
+Normal rank
@@ Property / cites work @@
+Finding the nearest point in A polytope
@@ Property / cites work: Finding the nearest point in A polytope / rank @@
+Normal rank