Pooling problems with polynomial-time algorithms
From MaRDI portal
Publication:306403
DOI10.1007/S10957-016-0890-5zbMATH Open1346.90681OpenAlexW2273650407MaRDI QIDQ306403FDOQ306403
E. M. T. Hendrix, Dag Haugland
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
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Nonconvex programming, global optimization (90C26) Dynamic programming (90C39)
Cites Work
- 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
- Title not available (Why is that?)
- Analysis of MILP Techniques for the Pooling Problem
- Successive Linear Programming at Exxon
- A bilinear approach to the pooling problem†
- Title not available (Why is that?)
- A polynomially solvable case of the pooling problem
- Title not available (Why is that?)
- The computational complexity of the pooling problem
- Solving planning and design problems in the process industry using mixed integer and global optimization
Cited In (7)
- Valid Inequalities for the Pooling Problem with Binary Variables
- Some results on pooling
- A polynomially solvable case of the pooling problem
- Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem
- Analyzing the Pooling Problem
- Title not available (Why is that?)
- Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness
Uses Software
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)
