A polynomially solvable case of the pooling problem

DOI10.1007/s10898-016-0432-6zbMath1365.90212arXiv1508.03181OpenAlexW1959262530WikidataQ57955263 ScholiaQ57955263MaRDI QIDQ513170

Fabian Rigterink, Natashia Boland, Thomas Kalinowski

Publication date: 3 March 2017

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1508.03181

zbMATH Keywords

computational complexitypolynomial-time algorithmpooling problem

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Nonconvex programming, global optimization (90C26)

Related Items (4)

Pooling problems with polynomial-time algorithms ⋮ 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 ⋮ Strong Convex Nonlinear Relaxations of the Pooling Problem

Cites Work

• Pooling problems with polynomial-time algorithms
• Relaxations and discretizations for the pooling problem
• New multi-commodity flow formulations for the pooling problem
• Global minimization by reducing the duality gap
• Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
• A multi-commodity flow formulation for the generalized pooling problem
• Strong formulations for the pooling problem
• Pooling Problem: Alternate Formulations and Solution Methods
• Analysis of MILP Techniques for the Pooling Problem
• Partition of Space
• The computational complexity of the pooling problem

This page was built for publication: A polynomially solvable case of the pooling problem