Cargando…
Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness
The standard pooling problem is a NP-hard subclass of non-convex quadratically-constrained optimization problems that commonly arises in process systems engineering applications. We take a parametric approach to uncovering topological structure and sparsity, focusing on the single quality standard p...
Autores principales: | , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer US
2017
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6417401/ https://www.ncbi.nlm.nih.gov/pubmed/30956395 http://dx.doi.org/10.1007/s10898-017-0577-y |