A polynomially solvable case of the pooling problem (Q513170): Difference between revisions

@@ Property / arXiv ID @@
+.03181
@@ Property / arXiv ID: 1508.03181 / rank @@
+Normal rank
@@ Property / cites work @@
+A multi-commodity flow formulation for the generalized 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 @@
+Global minimization by reducing the duality gap
@@ Property / cites work: Global minimization by reducing the duality gap / rank @@
+Normal rank
@@ Property / cites work @@
+New multi-commodity flow formulations for the pooling problem
+Normal rank
@@ Property / cites work @@
+The computational complexity of the pooling problem
+Normal rank
@@ Property / cites work @@
+Partition of Space
@@ Property / cites work: Partition of Space / rank @@
+Normal rank
@@ Property / cites work @@
+Analysis of MILP Techniques for the Pooling Problem
+Normal rank
@@ Property / cites work @@
+Relaxations and discretizations for the pooling problem
+Normal rank
@@ Property / cites work @@
+Pooling problems with polynomial-time algorithms
@@ Property / cites work: Pooling problems with polynomial-time algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
+Normal rank