Pooling problems with polynomial-time algorithms

DOI10.1007/s10957-016-0890-5zbMath1346.90681OpenAlexW2273650407MaRDI QIDQ306403

Dag Haugland, Eligius M. T. Hendrix

Publication date: 31 August 2016

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-016-0890-5

zbMATH Keywords

complexityglobal optimizationpolynomial-time algorithmpooling problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Nonconvex programming, global optimization (90C26) Dynamic programming (90C39)

Related Items

Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness ⋮ Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem ⋮ A polynomially solvable case of the pooling problem

Uses Software

• APOGEE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A polynomially solvable case of the pooling problem
• Solving planning and design problems in the process industry using mixed integer and global optimization
• Triangulations. Structures for algorithms and applications
• A new Lagrangean approach to the pooling problem
• Global minimization by reducing the duality gap
• Segments in enumerating faces
• Strong formulations for the pooling problem
• Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron.
• Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints
• Pooling Problem: Alternate Formulations and Solution Methods
• Analysis of MILP Techniques for the Pooling Problem
• Successive Linear Programming at Exxon
• A bilinear approach to the pooling problem†
• The computational complexity of the pooling problem