Analysis of MILP Techniques for the Pooling Problem (Q3453340): Difference between revisions

@@ Property / cites work @@
+Comparison of Discrete and Continuous Models for the Pooling Problem
+Normal rank
@@ Property / cites work @@
+A cost minimization heuristic for the pooling problem
+Normal rank
@@ Property / cites work @@
+Strong formulations for the pooling problem
@@ Property / cites work: Strong formulations for the pooling problem / rank @@
+Normal rank
@@ Property / cites work @@
+Pooling Problem: Alternate Formulations and Solution Methods
+Normal rank
@@ Property / cites work @@
+Successive Linear Programming at Exxon
@@ Property / cites work: Successive Linear Programming at Exxon / rank @@
+Normal rank
@@ Property / cites work @@
+Global minimization by reducing the duality gap
@@ Property / cites work: Global minimization by reducing the duality gap / rank @@
+Normal rank
@@ Property / cites work @@
+Valid Inequalities for the Pooling Problem with Binary Variables
+Normal rank
@@ Property / cites work @@
+Benchmarking optimization software with performance profiles.
+Normal rank
@@ Property / cites work @@
+Relaxations and discretizations for the pooling problem
+Normal rank
@@ Property / cites work @@
+Clique is hard to approximate within \(n^{1-\epsilon}\)
+Normal rank
@@ Property / cites work @@
+Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
+Normal rank