A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique (Q1187374): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Jointly Constrained Biconvex Programming
@@ Property / cites work: Jointly Constrained Biconvex Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized bilinear programming. I: Models, applications and linear programming relaxation
+Normal rank
@@ Property / cites work @@
+Nonlinear 0–1 programming: I. Linearization techniques
+Normal rank
@@ Property / cites work @@
+Nonlinear 0–1 programming: II. Dominance relations and algorithms
+Normal rank
@@ Property / cites work @@
+State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming
+Normal rank
@@ Property / cites work @@
+A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
+Normal rank
@@ Property / cites work @@
+Deterministic methods in constrained global optimization: Some recent advances and new fields of application
+Normal rank
@@ Property / cites work @@
+Q3997222
@@ Property / cites work: Q3997222 / rank @@
+Normal rank
@@ Property / cites work @@
+Constrained global optimization: algorithms and applications
+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