A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems (Q1329799): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
+Normal rank
@@ Property / cites work @@
+Mixed-integer bilinear programming problems
@@ Property / cites work: Mixed-integer bilinear programming problems / rank @@
+Normal rank
@@ Property / cites work @@
+Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
+Normal rank
@@ Property / cites work @@
+A lift-and-project cutting plane algorithm for mixed 0-1 programs
+Normal rank
@@ Property / cites work @@
+Upper-bounds for quadratic 0-1 maximization
@@ Property / cites work: Upper-bounds for quadratic 0-1 maximization / rank @@
+Normal rank
@@ Property / cites work @@
+Cones of Matrices and Set-Functions and 0–1 Optimization
+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 new reformulation-linearization technique for bilinear programming problems
+Normal rank
@@ Property / cites work @@
+A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
+Normal rank
@@ Property / cites work @@
+A squared-euclidean distance location-allocation problem
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0166-218x(92)00190-w
+Normal rank
@@ Property / OpenAlex ID @@
+W2076535438
@@ Property / OpenAlex ID: W2076535438 / rank @@
+Normal rank