A note on the MIR closure and basic relaxations of polyhedra (Q635512): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.orl.2011.02.011
+Normal rank
@@ Property / OpenAlex ID @@
+W1976553218
@@ Property / OpenAlex ID: W1976553218 / rank @@
+Normal rank
@@ Property / cites work @@
+Split closure and intersection cuts
@@ Property / cites work: Split closure and intersection cuts / rank @@
+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 @@
+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 @@
+Chvátal closures for mixed integer programming problems
+Normal rank
@@ Property / cites work @@
+MIR closures of polyhedral sets
@@ Property / cites work: MIR closures of polyhedral sets / rank @@
+Normal rank
@@ Property / cites work @@
+A recursive procedure to generate all cuts for 0-1 mixed integer programs
+Normal rank
@@ Property / cites work @@
+Q4054818
@@ Property / cites work: Q4054818 / rank @@
+Normal rank