Pooling problems with polynomial-time algorithms
type: Item
instance of: scholarly article
title: Pooling problems with polynomial-time algorithms
zbMATH Open document ID: 1346.90681
author: Dag Haugland
author: E. M. T. Hendrix
published in: Journal of Optimization Theory and Applications
publication date: 2016-08-31T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6621009
zbMATH Keywords: pooling problem
zbMATH Keywords: complexity
zbMATH Keywords: global optimization
zbMATH Keywords: polynomial-time algorithm
describes a project that uses: APOGEE
MaRDI profile type: Publication
full work available at URL: s10957-016-0890-5
OpenAlex ID: W2273650407
cites work: Successive Linear Programming at Exxon
cites work: Pooling Problem: Alternate Formulations and Solution Methods
cites work: A bilinear approach to the pooling problem†
cites work: Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints
cites work: Q4352205
cites work: A new Lagrangean approach to the pooling problem
cites work: Global minimization by reducing the duality gap
cites work: Analysis of MILP Techniques for the Pooling Problem
cites work: Solving planning and design problems in the process industry using mixed integer and global optimization
cites work: Q5306655
cites work: Strong formulations for the pooling problem
cites work: The computational complexity of the pooling problem
cites work: Q3231796
cites work: Triangulations. Structures for algorithms and applications
cites work: Segments in enumerating faces
cites work: Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron.
cites work: A polynomially solvable case of the pooling problem
DOI: 10.1007/S10957-016-0890-5
description: scientific article; zbMATH DE number 6621009