Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation (Q1019294): Difference between revisions

@@ Property / DOI @@
-.1016/j.disopt.2005.08.006
@@ Property / DOI: 10.1016/j.disopt.2005.08.006 / 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.1016/j.disopt.2005.08.006
+Normal rank
@@ Property / OpenAlex ID @@
+W2066961446
@@ Property / OpenAlex ID: W2066961446 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4735941
@@ Property / cites work: Q4735941 / rank @@
+Normal rank
@@ Property / cites work @@
+Disjunctive Programming
@@ Property / cites work: Disjunctive Programming / rank @@
+Normal rank
@@ 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 @@
+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 @@
+Lift-and-project for mixed 0-1 programming: recent progress
+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 @@
+Partitioning procedures for solving mixed-variables programming problems
+Normal rank
@@ Property / cites work @@
+Computational experience with a difficult mixed-integer multicommodity flow problem
+Normal rank
@@ Property / cites work @@
+Solving the Steiner Tree Problem on a Graph Using Branch and Cut
+Normal rank
@@ Property / cites work @@
+The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
+Normal rank
@@ Property / cites work @@
+A genetic algorithm for the multidimensional knapsack problem
+Normal rank
@@ Property / cites work @@
+Elementary closures for integer programs.
@@ Property / cites work: Elementary closures for integer programs. / rank @@
+Normal rank
@@ Property / cites work @@
+Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
+Normal rank
@@ Property / cites work @@
+The Steiner tree polytope and related polyhedra
@@ Property / cites work: The Steiner tree polytope and related polyhedra / rank @@
+Normal rank
@@ Property / cites work @@
+Q3274590
@@ Property / cites work: Q3274590 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5645210
@@ Property / cites work: Q5645210 / rank @@
+Normal rank
@@ Property / cites work @@
+Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
+Normal rank
@@ Property / cites work @@
+Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints
+Normal rank
@@ Property / cites work @@
+Q4845372
@@ Property / cites work: Q4845372 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4132247
@@ Property / cites work: Q4132247 / rank @@
+Normal rank
@@ Property / cites work @@
+Cones of Matrices and Set-Functions and 0–1 Optimization
+Normal rank
@@ Property / cites work @@
+Aggregation and Mixed Integer Rounding to Solve MIPs
+Normal rank
@@ Property / cites work @@
+Discrete cost multicommodity network optimization problems and exact solution methods
+Normal rank
@@ Property / cites work @@
+A recursive procedure to generate all cuts for 0-1 mixed integer programs
+Normal rank
@@ Property / cites work @@
+Optimization of a 532-city symmetric traveling salesman problem by branch and cut
+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 reformulation-linearization technique for solving discrete and continuous nonconvex problems
+Normal rank
@@ Property / cites work @@
+A polyhedral approach to multicommodity survivable network design
+Normal rank
@@ Property / cites work @@
+Reduce-and-Split Cuts: Improving the Performance of Mixed-Integer Gomory Cuts
+Normal rank
@@ Property / cites work @@
+Exact MAX-2SAT solution via lift-and-project closure
+Normal rank
@@ Property / DOI @@
+.1016/J.DISOPT.2005.08.006
@@ Property / DOI: 10.1016/J.DISOPT.2005.08.006 / rank @@
+Normal rank