Pooling problems with polynomial-time algorithms

DOI10.1007/S10957-016-0890-5MaRDI QIDQ306403zbMATH OpenOpenAlexFDO

Authors Dag Haugland, E. 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

global optimizationcomplexitypolynomial-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)

Recommendations

• The computational complexity of the pooling problem
• A polynomially solvable case of the pooling problem
• Complexity analysis and algorithm design of pooling problem
• A multi-commodity flow formulation for the generalized pooling problem
• Pooling problem: alternate formulations and solution methods

Cites work

• scientific article; zbMATH DE number 3117214 (Why is no real title available?)
• scientific article; zbMATH DE number 1054665 (Why is no real title available?)
• A bilinear approach to the pooling problem†
• A new Lagrangean approach to the pooling problem
• A polynomially solvable case of the pooling problem
• Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints
• Advances for the pooling problem: modeling, global optimization, and computational studies (Survey)
• Analysis of MILP techniques for the pooling problem
• Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron.
• Global minimization by reducing the duality gap
• Pooling problem: alternate formulations and solution methods
• Segments in enumerating faces
• Solving planning and design problems in the process industry using mixed integer and global optimization
• Strong formulations for the pooling problem
• Successive Linear Programming at Exxon
• The computational complexity of the pooling problem
• Triangulations. Structures for algorithms and applications

Cited in

(10)

• Complexity analysis and algorithm design of pooling problem
• Some results on pooling
• A polynomially solvable case of the pooling problem
• The computational complexity of the pooling problem
• Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem
• A multi-commodity flow formulation for the generalized pooling problem
• scientific article; zbMATH DE number 3993338 (Why is no real title available?)
• Valid Inequalities for the Pooling Problem with Binary Variables
• Analyzing the Pooling Problem
• Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness

Describes a project that uses

Uses Software

• APOGEE

This page was built for publication: Pooling problems with polynomial-time algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q306403)