Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness
R Baltean-Lugojan, R Misener - Journal of Global Optimization, 2018 - Springer
The standard pooling problem is a NP-hard subclass of non-convex quadratically-
constrained optimization problems that commonly arises in process systems engineering …
constrained optimization problems that commonly arises in process systems engineering …
A polynomially solvable case of the pooling problem
Answering a question of Haugland, we show that the pooling problem with one pool and a
bounded number of inputs can be solved in polynomial time by solving a polynomial number …
bounded number of inputs can be solved in polynomial time by solving a polynomial number …