| Title |
|
A polynomially solvable case of the pooling problem |
|
|
| Publication Date |
|
| Author(s) |
|
| Type of document |
|
| Language |
|
| Entity Type |
|
| Publisher |
|
| Place of publication |
|
| DOI |
|
10.1007/s10898-016-0432-6 |
|
|
| UNE publication id |
|
| 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. |
|
|
| Link |
|
| Citation |
|
Journal of Global Optimization, 67(3), p. 621-630 |
|
|
| ISSN |
|
| Start page |
|
| End page |
|