A finitely convergent procedure for facial disjunctive programs (Q1159568): Difference between revisions

@@ Property / cites work @@
+Q4120330
@@ Property / cites work: Q4120330 / rank @@
+Normal rank
@@ Property / cites work @@
+Disjunctive programming: Properties of the convex hull of feasible points
+Normal rank
@@ Property / cites work @@
+A converse for disjunctive constraints
@@ Property / cites work: A converse for disjunctive constraints / rank @@
+Normal rank
@@ Property / cites work @@
+Polyhedral convexity cuts and negative edge extensions
+Normal rank
@@ Property / cites work @@
+Polyhedral annexation in mixed integer and combinatorial programming
+Normal rank
@@ Property / cites work @@
+Q5547252
@@ Property / cites work: Q5547252 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4132247
@@ Property / cites work: Q4132247 / rank @@
+Normal rank
@@ Property / cites work @@
+Cutting-Planes for Complementarity Constraints
@@ Property / cites work: Cutting-Planes for Complementarity Constraints / rank @@
+Normal rank
@@ Property / cites work @@
+A Cutting-Plane Game for Facial Disjunctive Programs
+Normal rank
@@ Property / cites work @@
+Quasi-concave minimization subject to linear constraints
+Normal rank
@@ Property / cites work @@
+On the generation of deep disjunctive cutting planes
+Normal rank
@@ Property / cites work @@
+A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
+Normal rank
@@ Property / cites work @@
+Nondominated cuts for disjunctive programs and polyhedral annexation methods
+Normal rank