A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems (Q817200): Difference between revisions

@@ Property / DOI @@
-.1007/s10479-005-3966-4
@@ Property / DOI: 10.1007/s10479-005-3966-4 / rank @@
-Normal rank
@@ Property / author @@
-Warren P. Adams
@@ Property / author: Warren P. Adams / rank @@
-Normal rank
@@ Property / author @@
+Warren P. Adams
@@ Property / author: Warren P. Adams / 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/s10479-005-3966-4
+Normal rank
@@ Property / OpenAlex ID @@
+W2061945583
@@ Property / OpenAlex ID: W2061945583 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4321548
@@ Property / cites work: Q4321548 / rank @@
+Normal rank
@@ Property / cites work @@
+Persistency in 0-1 Polynomial Programming
@@ Property / cites work: Persistency in 0-1 Polynomial Programming / rank @@
+Normal rank
@@ Property / cites work @@
+A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
+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 @@
+Q3270229
@@ Property / cites work: Q3270229 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
+Normal rank
@@ Property / cites work @@
+Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
+Normal rank
@@ Property / cites work @@
+Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
+Normal rank
@@ Property / cites work @@
+Lower Bounds for the Quadratic Assignment Problem Based upon a Dual Formulation
+Normal rank
@@ Property / cites work @@
+Q4040931
@@ Property / cites work: Q4040931 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3048590
@@ Property / cites work: Q3048590 / rank @@
+Normal rank
@@ Property / cites work @@
+Semidefinite Programming vs. LP Relaxations for Polynomial Programming
+Normal rank
@@ Property / cites work @@
+The Integer Hull of a Convex Rational Polytope
@@ Property / cites work: The Integer Hull of a Convex Rational Polytope / rank @@
+Normal rank
@@ Property / cites work @@
+A conditional logic approach for strengthening mixed 0-1 linear programs
+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 hierarchy of relaxations and convex hull characterizations for mixed- integer 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 @@
+Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems
+Normal rank
@@ Property / cites work @@
+A new reformulation-linearization technique for bilinear programming problems
+Normal rank
@@ Property / cites work @@
+Enumeration approach for linear complementarity problems based on a reformulation-linearization technique
+Normal rank
@@ Property / cites work @@
+A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
+Normal rank
@@ Property / cites work @@
+Global optimization of nonconvex factorable programming problems
+Normal rank
@@ Property / DOI @@
+.1007/S10479-005-3966-4
@@ Property / DOI: 10.1007/S10479-005-3966-4 / rank @@
+Normal rank