A cost minimization heuristic for the pooling problem

DOI10.1007/s10479-013-1433-1zbMath1303.90110OpenAlexW2045170129MaRDI QIDQ490199

Mohammed Alfaki, Dag Haugland

Publication date: 22 January 2015

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-013-1433-1

zbMATH Keywords

network optimizationpooling problemheuristic methods

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (4)

Analysis of MILP Techniques for the Pooling Problem ⋮ A numerical evaluation of the bounded degree sum-of-squares hierarchy of Lasserre, Toh, and Yang on the pooling problem ⋮ Relaxations and discretizations for the pooling problem ⋮ New multi-commodity flow formulations for the pooling problem

Uses Software

• SINTEF

Cites Work

• An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
• A new Lagrangean approach to the pooling problem
• A simple SLP algorithm for solving a class of nonlinear programs
• A reformulation-linearization technique for solving discrete and continuous nonconvex problems
• Global minimization by reducing the duality gap
• A polyhedral branch-and-cut approach to global optimization
• 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
• A Nonlinear Programming Technique for the Optimization of Continuous Processing Systems
• Comparison of Discrete and Continuous Models for the Pooling Problem
• Pooling Problem: Alternate Formulations and Solution Methods
• An Improved Successive Linear Programming Algorithm
• Successive Linear Programming at Exxon
• A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints
• A Decomposition Strategy for Global Optimum Search in the Pooling Problem
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• A bilinear approach to the pooling problem†
• Modelling the pooling problem at the New Zealand Refining Company
• Nonlinear Optimization by Successive Linear Programming
• Optimization Models for the Natural Gas Value Chain

This page was built for publication: A cost minimization heuristic for the pooling problem