Partial convexification cuts for 0--1 mixed-integer programs (Q1771349): Difference between revisions

@@ Property / cites work @@
+Disjunctive programming: Properties of the convex hull of feasible points
+Normal rank
@@ Property / cites work @@
+A lift-and-project cutting plane algorithm for mixed 0-1 programs
+Normal rank
@@ Property / cites work @@
+Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
+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 @@
+Solving Large-Scale Zero-One Linear Programming Problems
+Normal rank
@@ Property / cites work @@
+Generating cuts from surrogate constraint analysis for zero-one and multiple choice programming
+Normal rank
@@ Property / cites work @@
+Cones of Matrices and Set-Functions and 0–1 Optimization
+Normal rank
@@ Property / cites work @@
+Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
+Normal rank
@@ Property / cites work @@
+A Facet Generation Procedure for Solving 0/1 Integer Programs
+Normal rank
@@ Property / cites work @@
+A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
+Normal rank
@@ Property / cites work @@
+A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
+Normal rank
@@ Property / cites work @@
+On the generation of deep disjunctive cutting planes
+Normal rank