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: | Baltean-Lugojan, Radu, Misener, Ruth |
---|---|
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 |
Ejemplares similares
-
Piecewise Polynomial Representations of Genomic Tracks
por: Tarabichi, Maxime, et al.
Publicado: (2012) -
On the Locally Polynomial Complexity of the Projection-Gradient Method for Solving Piecewise Quadratic Optimisation Problems
por: Prusińska, Agnieszka, et al.
Publicado: (2021) -
Memcomputing NP-complete problems in polynomial time using polynomial resources and collective states
por: Traversa, Fabio Lorenzo, et al.
Publicado: (2015) -
Evaluation of Piecewise Polynomial Equations for Two Types of Thermocouples
por: Chen, Andrew, et al.
Publicado: (2013) -
Almost complete solution for the NP-hard separability problem of Bell diagonal qutrits
por: Popp, Christopher, et al.
Publicado: (2022)