A relax-and-cut framework for Gomory mixed-integer cuts (Q1762453): Difference between revisions

@@ Property / DOI @@
-.1007/s12532-011-0024-x
@@ Property / DOI: 10.1007/s12532-011-0024-x / 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/s12532-011-0024-x
+Normal rank
@@ Property / OpenAlex ID @@
+W1990925151
@@ Property / OpenAlex ID: W1990925151 / rank @@
+Normal rank
@@ Property / cites work @@
+SCIP: solving constraint integer programs
@@ Property / cites work: SCIP: solving constraint integer programs / rank @@
+Normal rank
@@ Property / cites work @@
+Embedding {0, ½}-Cuts in a Branch-and-Cut Framework: A Computational Study
+Normal rank
@@ Property / cites work @@
+Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants
+Normal rank
@@ Property / cites work @@
+Gomory cuts revisited
@@ Property / cites work: Gomory cuts revisited / rank @@
+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 @@
+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 @@
+Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
+Normal rank
@@ Property / cites work @@
+A Heuristic Method for the Set Covering Problem
@@ Property / cites work: A Heuristic Method for the Set Covering Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Revival of the Gomory cuts in the 1990's
@@ Property / cites work: Revival of the Gomory cuts in the 1990's / rank @@
+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 @@
+A heuristic to generate rank-1 GMI cuts
@@ Property / cites work: A heuristic to generate rank-1 GMI cuts / rank @@
+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 Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships
+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 @@
+Feasibility pump 2.0
@@ Property / cites work: Feasibility pump 2.0 / rank @@
+Normal rank
@@ Property / cites work @@
+Integer Programming and Pricing
@@ Property / cites work: Integer Programming and Pricing / rank @@
+Normal rank
@@ Property / cites work @@
+Information-based branching schemes for binary linear mixed integer problems
+Normal rank
@@ Property / cites work @@
+Non delayed relax-and-cut algorithms
@@ Property / cites work: Non delayed relax-and-cut algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q5294045
@@ Property / cites work: Q5294045 / rank @@
+Normal rank
@@ Property / cites work @@
+On the capacitated vehicle routing problem
@@ Property / cites work: On the capacitated vehicle routing problem / rank @@
+Normal rank
@@ Property / cites work @@
+Lexicography and degeneracy: Can a pure cutting plane algorithm work?
+Normal rank
@@ Property / DOI @@
+.1007/S12532-011-0024-X
@@ Property / DOI: 10.1007/S12532-011-0024-X / rank @@
+Normal rank