The computational complexity of the pooling problem
From MaRDI portal
Publication:5964238
DOI10.1007/s10898-015-0335-yzbMath1360.90258OpenAlexW765132213MaRDI QIDQ5964238
Publication date: 29 February 2016
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-015-0335-y
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)
Related Items (9)
Pooling problems with polynomial-time algorithms ⋮ A numerical evaluation of the bounded degree sum-of-squares hierarchy of Lasserre, Toh, and Yang on the pooling problem ⋮ 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 ⋮ On the effectiveness of sequential linear programming for the pooling problem ⋮ Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms ⋮ Minimun overlap problem on finite groups ⋮ Strong Convex Nonlinear Relaxations of the Pooling Problem ⋮ A polynomially solvable case of the pooling problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving planning and design problems in the process industry using mixed integer and global optimization
- A new Lagrangean approach to the pooling problem
- Some simplified NP-complete graph problems
- Global minimization by reducing the duality gap
- Strong formulations for the pooling problem
- 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
- Jointly Constrained Biconvex Programming
- Successive Linear Programming at Exxon
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- The Minimum Satisfiability Problem
- A bilinear approach to the pooling problem†
This page was built for publication: The computational complexity of the pooling problem