Reflections on generating (disjunctive) cuts (Q458126): Difference between revisions

@@ Property / cites work @@
+Disjunctive Programming
@@ Property / cites work: Disjunctive Programming / rank @@
+Normal rank
@@ Property / cites work @@
+A lift-and-project cutting plane algorithm for mixed 0-1 programs
+Normal rank
@@ Property / cites work @@
+Acceleration of cutting-plane and column generation algorithms: Applications to network design
+Normal rank
@@ Property / cites work @@
+Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
+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 @@
+Computing deep facet-defining disjunctive cuts for mixed-integer programming
+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 @@
+An In-Out Approach to Disjunctive Optimization
@@ Property / cites work: An In-Out Approach to Disjunctive Optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Q2753173
@@ Property / cites work: Q2753173 / rank @@
+Normal rank
@@ Property / cites work @@
+A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
+Normal rank
@@ Property / cites work @@
+A Cholesky dual method for proximal piecewise linear programming
+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 @@
+Q4537754
@@ Property / cites work: Q4537754 / rank @@
+Normal rank
@@ Property / cites work @@
+A cutting-plane algorithm with linear and geometric rates of convergence
+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