A polynomially solvable case of the pooling problem
Optimization and Control
2017-02-09 v4 Discrete Mathematics
Combinatorics
Abstract
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 of linear programs of polynomial size. We also give an overview of known complexity results and remaining open problems to further characterize the border between (strongly) NP-hard and polynomially solvable cases of the pooling problem.
Cite
@article{arxiv.1508.03181,
title = {A polynomially solvable case of the pooling problem},
author = {Natashia Boland and Thomas Kalinowski and Fabian Rigterink},
journal= {arXiv preprint arXiv:1508.03181},
year = {2017}
}
Comments
updated references