MIR closures of polyhedral sets (Q847821): Difference between revisions

@@ Property / describes a project that uses @@
+Cgllandp
@@ Property / describes a project that uses: Cgllandp / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10107-008-0225-x
+Normal rank
@@ Property / OpenAlex ID @@
+W2155708792
@@ Property / OpenAlex ID: W2155708792 / 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 @@
+New Variants of Lift-and-Project Cut Generation from the LP Tableau: Open Source Implementation and Testing
+Normal rank
@@ Property / cites work @@
+Disjunctive Programming
@@ Property / cites work: Disjunctive Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
+Normal rank
@@ Property / cites work @@
+Gomory cuts revisited
@@ Property / cites work: Gomory cuts revisited / 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 @@
+Optimizing over the split closure
@@ Property / cites work: Optimizing over the split closure / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the MIR closure
@@ Property / cites work: A note on the MIR closure / rank @@
+Normal rank
@@ Property / cites work @@
+Projected Chvátal-Gomory cuts for mixed integer linear programs
+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 @@
+On the separation of split cuts and related inequalities
+Normal rank
@@ Property / cites work @@
+Edmonds polytopes and a hierarchy of combinatorial problems
+Normal rank
@@ Property / cites work @@
+Chvátal closures for mixed integer programming problems
+Normal rank
@@ Property / cites work @@
+Valid inequalities for mixed integer linear programs
+Normal rank
@@ Property / cites work @@
+Elementary closures for integer programs.
@@ Property / cites work: Elementary closures for integer programs. / rank @@
+Normal rank
@@ Property / cites work @@
+On the rank of mixed 0,1 polyhedra.
@@ Property / cites work: On the rank of mixed 0,1 polyhedra. / rank @@
+Normal rank
@@ Property / cites work @@
+Exploring relaxation induced neighborhoods to improve MIP solutions
+Normal rank
@@ Property / cites work @@
+Two-Step MIR Inequalities for Mixed Integer Programs
+Normal rank
@@ Property / cites work @@
+On the membership problem for the elementary closure of a polyhedron
+Normal rank
@@ Property / cites work @@
+Optimizing over the first Chvátal closure
@@ Property / cites work: Optimizing over the first Chvátal closure / rank @@
+Normal rank
@@ Property / cites work @@
+Aggregation and Mixed Integer Rounding to Solve MIPs
+Normal rank
@@ Property / cites work @@
+A recursive procedure to generate all cuts for 0-1 mixed integer programs
+Normal rank
@@ Property / cites work @@
+Q4040221
@@ Property / cites work: Q4040221 / rank @@
+Normal rank
@@ Property / cites work @@
+A constructive characterization of the split closure of a mixed integer linear program
+Normal rank
@@ Property / cites work @@
+Q4254875
@@ Property / cites work: Q4254875 / rank @@
+Normal rank