Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness
From MaRDI portal
Publication:1668789
DOI10.1007/s10898-017-0577-yzbMath1405.90103WikidataQ59613004 ScholiaQ59613004MaRDI QIDQ1668789
Ruth Misener, Radu Baltean-Lugojan
Publication date: 29 August 2018
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-017-0577-y
discretization; global optimization; sparsity; \(P/ NP\) boundary; piecewise structure; standard pooling problem; strongly-polynomial algorithms
90C26: Nonconvex programming, global optimization
Related Items
Uses Software