Please use this identifier to cite or link to this item:
https://hdl.handle.net/1959.11/26777| Title: | A polynomially solvable case of the pooling problem | Contributor(s): | Boland, Natashia (author); Kalinowski, Thomas (author) ; Rigterink, Fabian (author) |
Publication Date: | 2017-03 | DOI: | 10.1007/s10898-016-0432-6 | Handle Link: | https://hdl.handle.net/1959.11/26777 | 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. | Publication Type: | Journal Article | Grant Details: | ARC/LP110200524 | Source of Publication: | Journal of Global Optimization, 67(3), p. 621-630 | Publisher: | Springer New York LLC | Place of Publication: | United States of America | ISSN: | 1573-2916 0925-5001 |
Fields of Research (FoR) 2008: | 010303 Optimisation | Fields of Research (FoR) 2020: | 490304 Optimisation | Socio-Economic Objective (SEO) 2008: | 970101 Expanding Knowledge in the Mathematical Sciences | Socio-Economic Objective (SEO) 2020: | 280118 Expanding knowledge in the mathematical sciences | Peer Reviewed: | Yes | HERDC Category Description: | C1 Refereed Article in a Scholarly Journal |
|---|---|
| Appears in Collections: | Journal Article School of Science and Technology |
Files in This Item:
| File | Size | Format |
|---|
SCOPUSTM
Citations
5
checked on Apr 6, 2024
Page view(s)
1,320
checked on Mar 8, 2023
Download(s)
4
checked on Mar 8, 2023
Items in Research UNE are protected by copyright, with all rights reserved, unless otherwise indicated.